aboutsummaryrefslogtreecommitdiff
path: root/libstdc++-v3/docs/html/ext
diff options
context:
space:
mode:
authorBenjamin Kosnik <bkoz@redhat.com>2005-06-27 15:33:38 +0000
committerBenjamin Kosnik <bkoz@gcc.gnu.org>2005-06-27 15:33:38 +0000
commitfd1e17264b0e1b9adaf0cd2302b2f33a2e036b0c (patch)
tree0df480a2eef205a44aee318644b3d0b7c574b6a6 /libstdc++-v3/docs/html/ext
parentd4d3b0fffae3a6ad0979efdb6f1834c2c3711bfe (diff)
downloadgcc-fd1e17264b0e1b9adaf0cd2302b2f33a2e036b0c.zip
gcc-fd1e17264b0e1b9adaf0cd2302b2f33a2e036b0c.tar.gz
gcc-fd1e17264b0e1b9adaf0cd2302b2f33a2e036b0c.tar.bz2
documentation.html: Add link for policy based associative containers docs.
2005-06-27 Benjamin Kosnik <bkoz@redhat.com> Ami Tavory <pbassoc@gmail.com> * docs/html/documentation.html: Add link for policy based associative containers docs. * docs/html/ext/pb_assoc/Std_hash_set_impl.jpg: New. * docs/html/ext/pb_assoc/acks.html: New. * docs/html/ext/pb_assoc/balls_and_bins.jpg: New. * docs/html/ext/pb_assoc/basic_assoc_cntnr.html: New. * docs/html/ext/pb_assoc/basic_assoc_cntnr_compound_data.html: New. * docs/html/ext/pb_assoc/basic_assoc_cntnr_no_data.html: New. * docs/html/ext/pb_assoc/basic_ds_tag.html: New. * docs/html/ext/pb_assoc/basic_hash_assoc_cntnr.html: New. * docs/html/ext/pb_assoc/basic_hash_ds_tag.html: New. * docs/html/ext/pb_assoc/basic_invalidation_guarantee.html: New. * docs/html/ext/pb_assoc/basic_ms_tag.html: New. * docs/html/ext/pb_assoc/basic_tree_assoc_cntnr.html: New. * docs/html/ext/pb_assoc/ basic_tree_assoc_cntnr_const_node_iterator.html: New. * docs/html/ext/pb_assoc/ basic_tree_assoc_cntnr_node_iterator.html: New. * docs/html/ext/pb_assoc/basic_tree_assoc_cntnr_rev.html: New. * docs/html/ext/pb_assoc/basic_tree_assoc_cntnr_rev_it.html: New. * docs/html/ext/pb_assoc/basic_tree_ds_tag.html: New. * docs/html/ext/pb_assoc/cc_hash_assoc_cntnr.html: New. * docs/html/ext/pb_assoc/cc_hash_ds_tag.html: New. * docs/html/ext/pb_assoc/ cc_hash_max_collision_check_resize_trigger.html: New. * docs/html/ext/pb_assoc/cc_hash_policy_cd.jpg: New. * docs/html/ext/pb_assoc/cd.jpg: New. * docs/html/ext/pb_assoc/component_requirements.html: New. * docs/html/ext/pb_assoc/compound_data_enabled_ms_tag.html: New. * docs/html/ext/pb_assoc/compound_data_type.html: New. * docs/html/ext/pb_assoc/compound_ds_tag.html: New. * docs/html/ext/pb_assoc/concepts.html: New. * docs/html/ext/pb_assoc/contact.html: New. * docs/html/ext/pb_assoc/counter_update_metadata.html: New. * docs/html/ext/pb_assoc/counter_update_policy.html: New. * docs/html/ext/pb_assoc/data_enabled_ms_tag.html: New. * docs/html/ext/pb_assoc/design.html: New. * docs/html/ext/pb_assoc/different_underlying_dss.jpg: New. * docs/html/ext/pb_assoc/direct_mask_range_hashing.html: New. * docs/html/ext/pb_assoc/direct_mod_range_hashing.html: New. * docs/html/ext/pb_assoc/disclaimer.html: New. * docs/html/ext/pb_assoc/ds_gen.html: New. * docs/html/ext/pb_assoc/ds_tag_cd.jpg: New. * docs/html/ext/pb_assoc/ds_traits.html: New. * docs/html/ext/pb_assoc/embedded_lists_1.jpg: New. * docs/html/ext/pb_assoc/embedded_lists_2.jpg: New. * docs/html/ext/pb_assoc/examples.html: New. * docs/html/ext/pb_assoc/exception_guarantees_specifics.html: New. * docs/html/ext/pb_assoc/find_invalidation_guarantee.html: New. * docs/html/ext/pb_assoc/find_iterators_cd.jpg: New. * docs/html/ext/pb_assoc/find_iterators_range_ops_1.jpg: New. * docs/html/ext/pb_assoc/find_iterators_range_ops_2.jpg: New. * docs/html/ext/pb_assoc/generics.html: New. * docs/html/ext/pb_assoc/gp_hash_assoc_cntnr.html: New. * docs/html/ext/pb_assoc/gp_hash_ds_tag.html: New. * docs/html/ext/pb_assoc/gp_hash_policy_cd.jpg: New. * docs/html/ext/pb_assoc/hash_and_probe_general.html: New. * docs/html/ext/pb_assoc/hash_based_containers.html: New. * docs/html/ext/pb_assoc/hash_cd.jpg: New. * docs/html/ext/pb_assoc/hash_exponential_size_policy.html: New. * docs/html/ext/pb_assoc/hash_fn.html: New. * docs/html/ext/pb_assoc/hash_load_check_resize_trigger.html: New. * docs/html/ext/pb_assoc/hash_policies.html: New. * docs/html/ext/pb_assoc/hash_policy_cd.jpg: New. * docs/html/ext/pb_assoc/hash_prime_size_policy.html: New. * docs/html/ext/pb_assoc/hash_range_hashing_seq_diagram.jpg: New. * docs/html/ext/pb_assoc/hash_range_hashing_seq_diagram2.jpg: New. * docs/html/ext/pb_assoc/hash_ranged_hash_range_hashing_fns.jpg: New. * docs/html/ext/pb_assoc/hash_standard_resize_policy.html: New. * docs/html/ext/pb_assoc/home.html: New. * docs/html/ext/pb_assoc/index.html: New. * docs/html/ext/pb_assoc/insert_resize_sequence_diagram1.jpg: New. * docs/html/ext/pb_assoc/insert_resize_sequence_diagram2.jpg: New. * docs/html/ext/pb_assoc/insert_resize_sequence_diagram3.jpg: New. * docs/html/ext/pb_assoc/insert_type_methods.html: New. * docs/html/ext/pb_assoc/interface.html: New. * docs/html/ext/pb_assoc/interval_node_invariants.jpg: New. * docs/html/ext/pb_assoc/introduction.html: New. * docs/html/ext/pb_assoc/invalidation_guarantee_cd.jpg: New. * docs/html/ext/pb_assoc/invalidation_guarantee_erase.jpg: New. * docs/html/ext/pb_assoc/lib_download.html: New. * docs/html/ext/pb_assoc/linear_probe_fn.html: New. * docs/html/ext/pb_assoc/list_updates.html: New. * docs/html/ext/pb_assoc/lu_assoc_cntnr.html: New. * docs/html/ext/pb_assoc/lu_based_containers.html: New. * docs/html/ext/pb_assoc/lu_cd.jpg: New. * docs/html/ext/pb_assoc/lu_ds_tag.html: New. * docs/html/ext/pb_assoc/lu_ops.jpg: New. * docs/html/ext/pb_assoc/mmap_value_utils.html: New. * docs/html/ext/pb_assoc/motivation.html: New. * docs/html/ext/pb_assoc/move_to_front_update_metadata.html: New. * docs/html/ext/pb_assoc/move_to_front_update_policy.html: New. * docs/html/ext/pb_assoc/ms_cd.jpg: New. * docs/html/ext/pb_assoc/ms_gen.html: New. * docs/html/ext/pb_assoc/ms_tag_cd.jpg: New. * docs/html/ext/pb_assoc/ms_traits.html: New. * docs/html/ext/pb_assoc/node_invariant_invalidations.jpg: New. * docs/html/ext/pb_assoc/node_invariants.html: New. * docs/html/ext/pb_assoc/node_invariants.jpg: New. * docs/html/ext/pb_assoc/non_unique_mapping.html: New. * docs/html/ext/pb_assoc/non_unique_mapping_containers.jpg: New. * docs/html/ext/pb_assoc/null_data_type.html: New. * docs/html/ext/pb_assoc/null_hash_fn.html: New. * docs/html/ext/pb_assoc/null_probe_fn.html: New. * docs/html/ext/pb_assoc/order_by_key.html: New. * docs/html/ext/pb_assoc/order_statistics_key.html: New. * docs/html/ext/pb_assoc/order_statistics_key_cmp.html: New. * docs/html/ext/pb_assoc/order_statistics_node_updator.html: New. * docs/html/ext/pb_assoc/ov_tree_ds_tag.html: New. * docs/html/ext/pb_assoc/overview.html: New. * docs/html/ext/pb_assoc/pb_assoc_ex.html: New. * docs/html/ext/pb_assoc/portability.html: New. * docs/html/ext/pb_assoc/quadratic_probe_fn.html: New. * docs/html/ext/pb_assoc/range_invalidation_guarantee.html: New. * docs/html/ext/pb_assoc/rank_node_invariants.jpg: New. * docs/html/ext/pb_assoc/rationale_null_node_updator.jpg: New. * docs/html/ext/pb_assoc/rb_tree_ds_tag.html: New. * docs/html/ext/pb_assoc/reference_iterator.jpg: New. * docs/html/ext/pb_assoc/references.html: New. * docs/html/ext/pb_assoc/regression_tests.html: New. * docs/html/ext/pb_assoc/resize_general.html: New. * docs/html/ext/pb_assoc/resize_policies.html: New. * docs/html/ext/pb_assoc/resize_policy_cd.jpg: New. * docs/html/ext/pb_assoc/restoring_node_invariants.jpg: New. * docs/html/ext/pb_assoc/sample_node_updator.hpp: New. * docs/html/ext/pb_assoc/sample_probe_fn.hpp: New. * docs/html/ext/pb_assoc/sample_probe_fn.html: New. * docs/html/ext/pb_assoc/sample_range_hashing.hpp: New. * docs/html/ext/pb_assoc/sample_range_hashing.html: New. * docs/html/ext/pb_assoc/sample_ranged_hash_fn.hpp: New. * docs/html/ext/pb_assoc/sample_ranged_hash_fn.html: New. * docs/html/ext/pb_assoc/sample_ranged_probe_fn.hpp: New. * docs/html/ext/pb_assoc/sample_ranged_probe_fn.html: New. * docs/html/ext/pb_assoc/sample_resize_policy.hpp: New. * docs/html/ext/pb_assoc/sample_resize_policy.html: New. * docs/html/ext/pb_assoc/sample_resize_trigger.hpp: New. * docs/html/ext/pb_assoc/sample_size_policy.hpp: New. * docs/html/ext/pb_assoc/sample_update_policy.hpp: New. * docs/html/ext/pb_assoc/size_policies_general.html: New. * docs/html/ext/pb_assoc/splay_tree_ds_tag.html: New. * docs/html/ext/pb_assoc/timing_tests.html: New. * docs/html/ext/pb_assoc/toc.html: New. * docs/html/ext/pb_assoc/tree_assoc_cntnr.html: New. * docs/html/ext/pb_assoc/ tree_assoc_cntnr_const_node_iterator.html: New. * docs/html/ext/pb_assoc/tree_assoc_cntnr_node_iterator.html: New. * docs/html/ext/pb_assoc/tree_based_containers.html: New. * docs/html/ext/pb_assoc/tree_cd.jpg: New. * docs/html/ext/pb_assoc/trigger_policies_general.html: New. * docs/html/ext/pb_assoc/tutorial.html: New. * docs/html/ext/pb_assoc/update_seq_diagram.jpg: New. * include/Makefile.am: Add assoc_srcdir, assoc_builddir, assoc_subdir, assoc_headers. * include/Makefile.in: Regenerate. * include/ext/typelist.h: New. * include/ext/pb_assoc/assoc_cntnr.hpp: New. * include/ext/pb_assoc/data_type.hpp: New. * include/ext/pb_assoc/ds_trait.hpp: New. * include/ext/pb_assoc/exception.hpp: New. * include/ext/pb_assoc/hash_policy.hpp: New. * include/ext/pb_assoc/lu_policy.hpp: New. * include/ext/pb_assoc/ms_trait.hpp: New. * include/ext/pb_assoc/tree_policy.hpp: New. * include/ext/pb_assoc/trivial_iterator_def.hpp: New. * include/ext/pb_assoc/detail/assoc_cntnr_base.hpp: New. * include/ext/pb_assoc/detail/cond_dealtor.hpp: New. * include/ext/pb_assoc/detail/constructors_destructor_fn_imps.hpp: New. * include/ext/pb_assoc/detail/ds_trait_imp.hpp: New. * include/ext/pb_assoc/detail/hash_types_traits.hpp: New. * include/ext/pb_assoc/detail/map_debug_base.hpp: New. * include/ext/pb_assoc/detail/mapping_level_imp.hpp: New. * include/ext/pb_assoc/detail/ms_category_imp.hpp: New. * include/ext/pb_assoc/detail/ms_trait_imp.hpp: New. * include/ext/pb_assoc/detail/order_statistics_imp.hpp: New. * include/ext/pb_assoc/detail/standard_policies.hpp: New. * include/ext/pb_assoc/detail/standard_sizes.hpp: New. * include/ext/pb_assoc/detail/type_utils.hpp: New. * include/ext/pb_assoc/detail/typelist.hpp: New. * include/ext/pb_assoc/detail/types_traits.hpp: New. * include/ext/pb_assoc/detail/basic_assoc_cntnr/ constructor_destructor_fn_imps.hpp: New. * include/ext/pb_assoc/detail/basic_assoc_cntnr/ constructors_destructor_fn_imps.hpp: New. * include/ext/pb_assoc/detail/basic_assoc_cntnr/d_extract_key.hpp: New. * include/ext/pb_assoc/detail/basic_assoc_cntnr/ d_find_fn_imps.hpp: New. * include/ext/pb_assoc/detail/basic_assoc_cntnr/ d_insert_fn_imps.hpp: New. * include/ext/pb_assoc/detail/basic_assoc_cntnr/erase_fn_imps.hpp: New. * include/ext/pb_assoc/detail/basic_assoc_cntnr/extract_key.hpp: New. * include/ext/pb_assoc/detail/basic_assoc_cntnr/info_fn_imps.hpp: New. * include/ext/pb_assoc/detail/basic_assoc_cntnr/ insert_fn_imps.hpp: New. * include/ext/pb_assoc/detail/basic_assoc_cntnr/ iterators_fn_imps.hpp: New. * include/ext/pb_assoc/detail/basic_hash_assoc_cntnr/ constructor_destructor_fn_imps.hpp: New. * include/ext/pb_assoc/detail/basic_hash_assoc_cntnr/ constructors_destructor_fn_imps.hpp: New. * include/ext/pb_assoc/detail/basic_hash_assoc_cntnr/ resize_fn_imps.hpp: New. * include/ext/pb_assoc/detail/basic_tree_assoc_cntnr/ constructor_destructor_fn_imps.hpp: New. * include/ext/pb_assoc/detail/basic_tree_assoc_cntnr/ constructors_destructor_fn_imps.hpp: New. * include/ext/pb_assoc/detail/basic_tree_assoc_cntnr/ erase_fn_imps.hpp: New. * include/ext/pb_assoc/detail/basic_tree_assoc_cntnr/ node_iteration_fn_imps.hpp: New. * include/ext/pb_assoc/detail/basic_tree_assoc_cntnr/ policy_access_fn_imps.hpp: New. * include/ext/pb_assoc/detail/basic_tree_assoc_cntnr/ r_erase_fn_imps.hpp: New. * include/ext/pb_assoc/detail/basic_tree_assoc_cntnr/ r_range_iteration_fn_imps.hpp: New. * include/ext/pb_assoc/detail/basic_tree_assoc_cntnr/ range_iteration_fn_imps.hpp: New. * include/ext/pb_assoc/detail/basic_tree_assoc_cntnr/ split_join_fn_imps.hpp: New. * include/ext/pb_assoc/detail/bin_search_tree_/ bin_search_tree_.hpp: New. * include/ext/pb_assoc/detail/bin_search_tree_/ cond_dtor_entry_dealtor.hpp: New. * include/ext/pb_assoc/detail/bin_search_tree_/ cond_key_dtor_entry_dealtor.hpp: New. * include/ext/pb_assoc/detail/bin_search_tree_/ constructors_destructor_fn_imps.hpp: New. * include/ext/pb_assoc/detail/bin_search_tree_/debug_fn_imps.hpp: New. * include/ext/pb_assoc/detail/bin_search_tree_/erase_fn_imps.hpp: New. * include/ext/pb_assoc/detail/bin_search_tree_/find_fn_imps.hpp: New. * include/ext/pb_assoc/detail/bin_search_tree_/find_iterators.hpp: New. * include/ext/pb_assoc/detail/bin_search_tree_/info_fn_imps.hpp: New. * include/ext/pb_assoc/detail/bin_search_tree_/insert_fn_imps.hpp: New. * include/ext/pb_assoc/detail/bin_search_tree_/ iterators_fn_imps.hpp: New. * include/ext/pb_assoc/detail/bin_search_tree_/node_iterators.hpp: New. * include/ext/pb_assoc/detail/bin_search_tree_/ r_erase_fn_imps.hpp: New. * include/ext/pb_assoc/detail/bin_search_tree_/rotate_fn_imps.hpp: New. * include/ext/pb_assoc/detail/bin_search_tree_/ split_join_fn_imps.hpp: New. * include/ext/pb_assoc/detail/cc_hash_assoc_cntnr/ constructor_destructor_fn_imps.hpp: New. * include/ext/pb_assoc/detail/cc_ht_map_/cc_ht_map_.hpp: New. * include/ext/pb_assoc/detail/cc_ht_map_/cmp_fn_imps.hpp: New. * include/ext/pb_assoc/detail/cc_ht_map_/ cond_key_dtor_entry_dealtor.hpp: New. * include/ext/pb_assoc/detail/cc_ht_map_/ constructor_destructor_fn_imps.hpp: New. * include/ext/pb_assoc/detail/cc_ht_map_/ constructor_destructor_no_store_hash_fn_imps.hpp: New. * include/ext/pb_assoc/detail/cc_ht_map_/ constructor_destructor_store_hash_fn_imps.hpp: New. * include/ext/pb_assoc/detail/cc_ht_map_/debug_fn_imps.hpp: New. * include/ext/pb_assoc/detail/cc_ht_map_/ debug_no_store_hash_fn_imps.hpp: New. * include/ext/pb_assoc/detail/cc_ht_map_/ debug_store_hash_fn_imps.hpp: New. * include/ext/pb_assoc/detail/cc_ht_map_/entry_list_fn_imps.hpp: New. * include/ext/pb_assoc/detail/cc_ht_map_/erase_fn_imps.hpp: New. * include/ext/pb_assoc/detail/cc_ht_map_/ erase_no_store_hash_fn_imps.hpp: New. * include/ext/pb_assoc/detail/cc_ht_map_/ erase_store_hash_fn_imps.hpp: New. * include/ext/pb_assoc/detail/cc_ht_map_/ find_fn_imps.hpp: New. * include/ext/pb_assoc/detail/cc_ht_map_/ find_no_store_hash_fn_imps.hpp: New. * include/ext/pb_assoc/detail/cc_ht_map_/ find_store_hash_fn_imps.hpp: New. * include/ext/pb_assoc/detail/cc_ht_map_/info_fn_imps.hpp: New. * include/ext/pb_assoc/detail/cc_ht_map_/insert_fn_imps.hpp: New. * include/ext/pb_assoc/detail/cc_ht_map_/ insert_no_store_hash_fn_imps.hpp: New. * include/ext/pb_assoc/detail/cc_ht_map_/ insert_store_hash_fn_imps.hpp: New. * include/ext/pb_assoc/detail/cc_ht_map_/iterators_fn_imps.hpp: New. * include/ext/pb_assoc/detail/cc_ht_map_/ policy_access_fn_imps.hpp: New. * include/ext/pb_assoc/detail/cc_ht_map_/resize_fn_imps.hpp: New. * include/ext/pb_assoc/detail/cc_ht_map_/ resize_no_store_hash_fn_imps.hpp: New. * include/ext/pb_assoc/detail/cc_ht_map_/ resize_store_hash_fn_imps.hpp: New. * include/ext/pb_assoc/detail/cc_ht_map_/size_fn_imps.hpp: New. * include/ext/pb_assoc/detail/cc_ht_map_/standard_policies.hpp: New. * include/ext/pb_assoc/detail/eq_fn/eq_by_less.hpp: New. * include/ext/pb_assoc/detail/eq_fn/hash_eq_fn.hpp: New. * include/ext/pb_assoc/detail/gp_hash_assoc_cntnr/ constructor_destructor_fn_imps.hpp: New. * include/ext/pb_assoc/detail/gp_ht_map_/ constructor_destructor_fn_imps.hpp: New. * include/ext/pb_assoc/detail/gp_ht_map_/ constructor_destructor_no_store_hash_fn_imps.hpp: New. * include/ext/pb_assoc/detail/gp_ht_map_/ constructor_destructor_store_hash_fn_imps.hpp: New. * include/ext/pb_assoc/detail/gp_ht_map_/debug_fn_imps.hpp: New. * include/ext/pb_assoc/detail/gp_ht_map_/ debug_no_store_hash_fn_imps.hpp: New. * include/ext/pb_assoc/detail/gp_ht_map_/ debug_store_hash_fn_imps.hpp: New. * include/ext/pb_assoc/detail/gp_ht_map_/erase_fn_imps.hpp: New. * include/ext/pb_assoc/detail/gp_ht_map_/ erase_no_store_hash_fn_imps.hpp: New. * include/ext/pb_assoc/detail/gp_ht_map_/ erase_store_hash_fn_imps.hpp: New. * include/ext/pb_assoc/detail/gp_ht_map_/find_fn_imps.hpp: New. * include/ext/pb_assoc/detail/gp_ht_map_/ find_no_store_hash_fn_imps.hpp: New. * include/ext/pb_assoc/detail/gp_ht_map_/ find_store_hash_fn_imps.hpp: New. * include/ext/pb_assoc/detail/gp_ht_map_/gp_ht_map_.hpp: New. * include/ext/pb_assoc/detail/gp_ht_map_/info_fn_imps.hpp: New. * include/ext/pb_assoc/detail/gp_ht_map_/insert_fn_imps.hpp: New. * include/ext/pb_assoc/detail/gp_ht_map_/ insert_no_store_hash_fn_imps.hpp: New. * include/ext/pb_assoc/detail/gp_ht_map_/ insert_store_hash_fn_imps.hpp: New. * include/ext/pb_assoc/detail/gp_ht_map_/iterator_fn_imps.hpp: New. * include/ext/pb_assoc/detail/gp_ht_map_/ policy_access_fn_imps.hpp: New. * include/ext/pb_assoc/detail/gp_ht_map_/resize_fn_imps.hpp: New. * include/ext/pb_assoc/detail/gp_ht_map_/ resize_no_store_hash_fn_imps.hpp: New. * include/ext/pb_assoc/detail/gp_ht_map_/ resize_store_hash_fn_imps.hpp: New. * include/ext/pb_assoc/detail/hash_fn/ direct_mask_range_hashing_imp.hpp: New. * include/ext/pb_assoc/detail/hash_fn/ direct_mod_range_hashing_imp.hpp: New. * include/ext/pb_assoc/detail/hash_fn/linear_probe_fn_imp.hpp: New. * include/ext/pb_assoc/detail/hash_fn/ mask_based_range_hashing.hpp: New. * include/ext/pb_assoc/detail/hash_fn/mod_based_range_hashing.hpp: New. * include/ext/pb_assoc/detail/hash_fn/probe_fn_base.hpp: New. * include/ext/pb_assoc/detail/hash_fn/quadratic_probe_fn_imp.hpp: New. * include/ext/pb_assoc/detail/hash_fn/ranged_hash_fn.hpp: New. * include/ext/pb_assoc/detail/hash_fn/ranged_probe_fn.hpp: New. * include/ext/pb_assoc/detail/lu_assoc_cntnr/ constructor_destructor_fn_imps.hpp: New. * include/ext/pb_assoc/detail/lu_assoc_cntnr/ policy_access_fn_imps.hpp: New. * include/ext/pb_assoc/detail/lu_map_/ constructor_destructor_fn_imps.hpp: New. * include/ext/pb_assoc/detail/lu_map_/debug_fn_imps.hpp: New. * include/ext/pb_assoc/detail/lu_map_/erase_fn_imps.hpp: New. * include/ext/pb_assoc/detail/lu_map_/find_fn_imps.hpp: New. * include/ext/pb_assoc/detail/lu_map_/info_fn_imps.hpp: New. * include/ext/pb_assoc/detail/lu_map_/insert_fn_imps.hpp: New. * include/ext/pb_assoc/detail/lu_map_/iterators_fn_imps.hpp: New. * include/ext/pb_assoc/detail/lu_map_/lu_map_.hpp: New. * include/ext/pb_assoc/detail/lu_map_/policy_access_fn_imps.hpp: New. * include/ext/pb_assoc/detail/lu_policy/ counter_lu_metadata_imp.hpp: New. * include/ext/pb_assoc/detail/lu_policy/counter_lu_policy_imp.hpp: New. * include/ext/pb_assoc/detail/lu_policy/mtf_lu_policy_imp.hpp: New. * include/ext/pb_assoc/detail/ov_tree_map_/cond_dtor.hpp: New. * include/ext/pb_assoc/detail/ov_tree_map_/ constructors_destructor_fn_imps.hpp: New. * include/ext/pb_assoc/detail/ov_tree_map_/debug_fn_imps.hpp: New. * include/ext/pb_assoc/detail/ov_tree_map_/erase_fn_imps.hpp: New. * include/ext/pb_assoc/detail/ov_tree_map_/find_fn_imps.hpp: New. * include/ext/pb_assoc/detail/ov_tree_map_/info_fn_imps.hpp: New. * include/ext/pb_assoc/detail/ov_tree_map_/insert_fn_imps.hpp: New. * include/ext/pb_assoc/detail/ov_tree_map_/iterators_fn_imps.hpp: New. * include/ext/pb_assoc/detail/ov_tree_map_/node_iterators.hpp: New. * include/ext/pb_assoc/detail/ov_tree_map_/ov_tree_map_.hpp: New. * include/ext/pb_assoc/detail/ov_tree_map_/split_join_fn_imps.hpp: New. * include/ext/pb_assoc/detail/rb_tree_map_/ constructors_destructor_fn_imps.hpp: New. * include/ext/pb_assoc/detail/rb_tree_map_/debug_fn_imps.hpp: New. * include/ext/pb_assoc/detail/rb_tree_map_/erase_fn_imps.hpp: New. * include/ext/pb_assoc/detail/rb_tree_map_/find_fn_imps.hpp: New. * include/ext/pb_assoc/detail/rb_tree_map_/info_fn_imps.hpp: New. * include/ext/pb_assoc/detail/rb_tree_map_/insert_fn_imps.hpp: New. * include/ext/pb_assoc/detail/rb_tree_map_/node.hpp: New. * include/ext/pb_assoc/detail/rb_tree_map_/rb_tree_.hpp: New. * include/ext/pb_assoc/detail/rb_tree_map_/split_join_fn_imps.hpp: New. * include/ext/pb_assoc/detail/resize_policy/ cc_hash_max_collision_resize_trigger_imp.hpp: New. * include/ext/pb_assoc/detail/resize_policy/ hash_exponential_size_policy_imp.hpp: New. * include/ext/pb_assoc/detail/resize_policy/ hash_load_check_resize_trigger_imp.hpp: New. * include/ext/pb_assoc/detail/resize_policy/ hash_prime_size_policy_imp.hpp: New. * include/ext/pb_assoc/detail/resize_policy/ hash_standard_resize_policy_imp.hpp: New. * include/ext/pb_assoc/detail/resize_policy/ ht_prime_size_policy_imp.hpp: New. * include/ext/pb_assoc/detail/resize_policy/size_base.hpp: New. * include/ext/pb_assoc/detail/splay_tree_/ constructors_destructor_fn_imps.hpp: New. * include/ext/pb_assoc/detail/splay_tree_/debug_fn_imps.hpp: New. * include/ext/pb_assoc/detail/splay_tree_/erase_fn_imps.hpp: New. * include/ext/pb_assoc/detail/splay_tree_/find_fn_imps.hpp: New. * include/ext/pb_assoc/detail/splay_tree_/info_fn_imps.hpp: New. * include/ext/pb_assoc/detail/splay_tree_/insert_fn_imps.hpp: New. * include/ext/pb_assoc/detail/splay_tree_/node.hpp: New. * include/ext/pb_assoc/detail/splay_tree_/splay_fn_imps.hpp: New. * include/ext/pb_assoc/detail/splay_tree_/splay_tree_.hpp: New. * include/ext/pb_assoc/detail/splay_tree_/split_join_fn_imps.hpp: New. * include/ext/pb_assoc/detail/tree_assoc_cntnr/ constructor_destructor_fn_imps.hpp: New. * include/ext/pb_assoc/detail/tree_policy/ null_node_updator_imp.hpp: New. * include/ext/pb_assoc/detail/tree_policy/ order_statistics_imp.hpp: New. * include/ext/pb_assoc/detail/typelist/typelist_append.hpp: New. * include/ext/pb_assoc/detail/typelist/typelist_apply.hpp: New. * include/ext/pb_assoc/detail/typelist/typelist_at_index.hpp: New. * include/ext/pb_assoc/detail/typelist/typelist_contains.hpp: New. * include/ext/pb_assoc/detail/typelist/typelist_filter.hpp: New. * include/ext/pb_assoc/detail/typelist/typelist_transform.hpp: New. * include/ext/pb_assoc/detail/typelist/ typelist_typelist_append.hpp: New. * include/ext/pb_assoc/detail/unordered_iterator/ const_find_iterator.hpp: New. * include/ext/pb_assoc/detail/unordered_iterator/ const_iterator.hpp: New. * include/ext/pb_assoc/detail/unordered_iterator/ find_iterator.hpp: New. * include/ext/pb_assoc/detail/unordered_iterator/iterator.hpp: New. * include/ext/pb_assoc/detail/value_type_adapter/ constructor_destructor_and_related.hpp: New. * include/ext/pb_assoc/detail/value_type_adapter/ erase_fn_imps.hpp: New. * include/ext/pb_assoc/detail/value_type_adapter/ erase_if_pred.hpp: New. * include/ext/pb_assoc/detail/value_type_adapter/find_fn_imps.hpp: New. * include/ext/pb_assoc/detail/value_type_adapter/info_fn_imps.hpp: New. * include/ext/pb_assoc/detail/value_type_adapter/ insert_fn_imps.hpp: New. * include/ext/pb_assoc/detail/value_type_adapter/ invalidation_guarantee_selector.hpp: New. * include/ext/pb_assoc/detail/value_type_adapter/ it_value_type_traits.hpp: New. * include/ext/pb_assoc/detail/value_type_adapter/iterator.hpp: New. * include/ext/pb_assoc/detail/value_type_adapter/ iterator_fn_imps.hpp: New. * include/ext/pb_assoc/detail/value_type_adapter/ref_pair.hpp: New. * include/ext/pb_assoc/detail/value_type_adapter/ value_type_adapter.hpp: New. * include/ext/pb_assoc/detail/value_type_adapter/ value_type_traits.hpp: New. * testsuite/Makefile.am (CLEANFILES): Add .o, .dat, .cc. * testsuite/Makefile.in: Regenerate. * testsuite/testsuite_common_types.h: New. * testsuite/testsuite_visualization.h: New. * testsuite/ext/pb_assoc/example/basic_map.cc: New. * testsuite/ext/pb_assoc/example/basic_multimap.cc: New. * testsuite/ext/pb_assoc/example/basic_set.cc: New. * testsuite/ext/pb_assoc/example/ds_traits.cc: New. * testsuite/ext/pb_assoc/example/erase_if.cc: New. * testsuite/ext/pb_assoc/example/extract_key.cc: New. * testsuite/ext/pb_assoc/example/hash_find_neg.cc: New. * testsuite/ext/pb_assoc/example/hash_illegal_resize.cc: New. * testsuite/ext/pb_assoc/example/hash_initial_size.cc: New. * testsuite/ext/pb_assoc/example/hash_load_set_change.cc: New. * testsuite/ext/pb_assoc/example/hash_mod.cc: New. * testsuite/ext/pb_assoc/example/hash_resize.cc: New. * testsuite/ext/pb_assoc/example/hash_resize_neg.cc: New. * testsuite/ext/pb_assoc/example/hash_shift_mask.cc: New. * testsuite/ext/pb_assoc/example/mapping_level.cc: New. * testsuite/ext/pb_assoc/example/mapping_level_neg.cc: New. * testsuite/ext/pb_assoc/example/ms_traits.cc: New. * testsuite/ext/pb_assoc/example/ranged_hash.cc: New. * testsuite/ext/pb_assoc/example/store_hash.cc: New. * testsuite/ext/pb_assoc/example/tree_intervals.cc: New. * testsuite/ext/pb_assoc/example/tree_join.cc: New. * testsuite/ext/pb_assoc/example/tree_order_statistics.cc: New. * testsuite/ext/pb_assoc/example/tree_order_statistics_join.cc: New. * testsuite/ext/pb_assoc/example/tree_split.cc: New. * testsuite/performance/20_util/allocator/(insert.cc, insert_insert.cc, list_sort_search.cc, map_mt_find.cc, map_thread.cc, producer_consumer.cc): Recast to use typelists and move to... * testsuite/performance/23_containers/find/map.cc: New. * testsuite/performance/23_containers/index/map.cc: New. * testsuite/performance/23_containers/insert/associative.cc: New. * testsuite/performance/23_containers/insert/sequence.cc: New. * testsuite/performance/23_containers/insert_erase/associative.cc: New. * testsuite/performance/23_containers/producer_consumer/ (associative.cc, sequence.cc): New. * testsuite/performance/23_containers/sort_search/list.cc: New. * testsuite/performance/23_containers/container_benchmark.cc: Remove. * testsuite/performance/23_containers/map_create_fill.cc: Move... * testsuite/performance/23_containers/create/map.cc: ...here. * testsuite/performance/23_containers/set_create_from_sorted.cc: Move. * testsuite/performance/23_containers/create_from_sorted/set.cc: here. * testsuite/performance/23_containers/list_create_fill_sort.cc: Move... * testsuite/performance/23_containers/create_sort/list.cc: ...here. * testsuite/performance/23_containers/set_insert_from_sorted.cc: Move. * testsuite/performance/23_containers/insert_from_sorted/set.cc: here. Co-Authored-By: Ami Tavory <pbassoc@gmail.com> From-SVN: r101354
Diffstat (limited to 'libstdc++-v3/docs/html/ext')
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/Std_hash_set_impl.jpgbin0 -> 51488 bytes
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/acks.html46
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/balls_and_bins.jpgbin0 -> 18512 bytes
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/basic_assoc_cntnr.html1229
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/basic_assoc_cntnr_compound_data.html1244
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/basic_assoc_cntnr_no_data.html1046
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/basic_ds_tag.html41
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/basic_hash_assoc_cntnr.html609
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/basic_hash_ds_tag.html74
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/basic_invalidation_guarantee.html41
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/basic_ms_tag.html41
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/basic_tree_assoc_cntnr.html940
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/basic_tree_assoc_cntnr_const_node_iterator.html488
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/basic_tree_assoc_cntnr_node_iterator.html250
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/basic_tree_assoc_cntnr_rev.html771
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/basic_tree_assoc_cntnr_rev_it.html771
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/basic_tree_ds_tag.html74
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/cc_hash_assoc_cntnr.html679
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/cc_hash_ds_tag.html74
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/cc_hash_max_collision_check_resize_trigger.html701
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/cc_hash_policy_cd.jpgbin0 -> 27118 bytes
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/cd.jpgbin0 -> 58234 bytes
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/component_requirements.html51
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/compound_data_enabled_ms_tag.html41
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/compound_data_type.html128
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/compound_ds_tag.html77
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/concepts.html124
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/contact.html19
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/counter_update_metadata.html101
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/counter_update_policy.html380
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/data_enabled_ms_tag.html41
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/design.html23
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/different_underlying_dss.jpgbin0 -> 34944 bytes
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/direct_mask_range_hashing.html251
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/direct_mod_range_hashing.html228
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/disclaimer.html25
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/ds_gen.html368
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/ds_tag_cd.jpgbin0 -> 54661 bytes
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/ds_traits.html41
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/embedded_lists_1.jpgbin0 -> 24191 bytes
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/embedded_lists_2.jpgbin0 -> 23766 bytes
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/examples.html185
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/exception_guarantees_specifics.html31
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/find_invalidation_guarantee.html74
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/find_iterators_cd.jpgbin0 -> 48752 bytes
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/find_iterators_range_ops_1.jpgbin0 -> 18521 bytes
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/find_iterators_range_ops_2.jpgbin0 -> 25683 bytes
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/generics.html25
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/gp_hash_assoc_cntnr.html816
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/gp_hash_ds_tag.html74
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/gp_hash_policy_cd.jpgbin0 -> 39817 bytes
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/hash_and_probe_general.html45
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/hash_based_containers.html1056
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/hash_cd.jpgbin0 -> 54780 bytes
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/hash_exponential_size_policy.html267
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/hash_fn.html25
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/hash_load_check_resize_trigger.html744
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/hash_policies.html375
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/hash_policy_cd.jpgbin0 -> 59739 bytes
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/hash_prime_size_policy.html211
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/hash_range_hashing_seq_diagram.jpgbin0 -> 30271 bytes
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/hash_range_hashing_seq_diagram2.jpgbin0 -> 20756 bytes
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/hash_ranged_hash_range_hashing_fns.jpgbin0 -> 35579 bytes
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/hash_standard_resize_policy.html986
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/home.html56
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/index.html12
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/insert_resize_sequence_diagram1.jpgbin0 -> 66060 bytes
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/insert_resize_sequence_diagram2.jpgbin0 -> 43557 bytes
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/insert_resize_sequence_diagram3.jpgbin0 -> 39549 bytes
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/insert_type_methods.html42
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/interface.html342
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/interval_node_invariants.jpgbin0 -> 31555 bytes
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/introduction.html31
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/invalidation_guarantee_cd.jpgbin0 -> 23162 bytes
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/invalidation_guarantee_erase.jpgbin0 -> 56109 bytes
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/lib_download.html47
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/linear_probe_fn.html238
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/list_updates.html138
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/lu_assoc_cntnr.html570
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/lu_based_containers.html225
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/lu_cd.jpgbin0 -> 60906 bytes
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/lu_ds_tag.html74
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/lu_ops.jpgbin0 -> 36112 bytes
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/mmap_value_utils.html128
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/motivation.html281
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/move_to_front_update_metadata.html41
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/move_to_front_update_policy.html256
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/ms_cd.jpgbin0 -> 61973 bytes
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/ms_gen.html440
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/ms_tag_cd.jpgbin0 -> 21009 bytes
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/ms_traits.html131
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/node_invariant_invalidations.jpgbin0 -> 43521 bytes
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/node_invariants.html154
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/node_invariants.jpgbin0 -> 32622 bytes
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/non_unique_mapping.html404
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/non_unique_mapping_containers.jpgbin0 -> 19257 bytes
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/null_data_type.html41
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/null_hash_fn.html44
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/null_probe_fn.html44
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/order_by_key.html254
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/order_statistics_key.html373
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/order_statistics_key_cmp.html422
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/order_statistics_node_updator.html278
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/ov_tree_ds_tag.html74
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/overview.html139
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/pb_assoc_ex.html74
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/portability.html26
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/quadratic_probe_fn.html238
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/range_invalidation_guarantee.html74
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/rank_node_invariants.jpgbin0 -> 28798 bytes
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/rationale_null_node_updator.jpgbin0 -> 27057 bytes
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/rb_tree_ds_tag.html74
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/reference_iterator.jpgbin0 -> 32467 bytes
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/references.html94
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/regression_tests.html25
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/resize_general.html28
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/resize_policies.html487
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/resize_policy_cd.jpgbin0 -> 58948 bytes
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/restoring_node_invariants.jpgbin0 -> 26335 bytes
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/sample_node_updator.hpp116
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/sample_probe_fn.hpp121
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/sample_probe_fn.html177
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/sample_range_hashing.hpp147
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/sample_range_hashing.html213
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/sample_ranged_hash_fn.hpp141
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/sample_ranged_hash_fn.html129
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/sample_ranged_probe_fn.hpp143
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/sample_ranged_probe_fn.html129
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/sample_resize_policy.hpp310
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/sample_resize_policy.html536
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/sample_resize_trigger.hpp341
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/sample_size_policy.hpp140
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/sample_update_policy.hpp171
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/size_policies_general.html22
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/splay_tree_ds_tag.html74
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/timing_tests.html60
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/toc.html35
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/tree_assoc_cntnr.html493
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/tree_assoc_cntnr_const_node_iterator.html488
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/tree_assoc_cntnr_node_iterator.html250
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/tree_based_containers.html246
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/tree_cd.jpgbin0 -> 60672 bytes
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/trigger_policies_general.html23
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/tutorial.html66
-rw-r--r--libstdc++-v3/docs/html/ext/pb_assoc/update_seq_diagram.jpgbin0 -> 23396 bytes
145 files changed, 26901 insertions, 0 deletions
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/Std_hash_set_impl.jpg b/libstdc++-v3/docs/html/ext/pb_assoc/Std_hash_set_impl.jpg
new file mode 100644
index 0000000..ff7bae0
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/Std_hash_set_impl.jpg
Binary files differ
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/acks.html b/libstdc++-v3/docs/html/ext/pb_assoc/acks.html
new file mode 100644
index 0000000..a4971d1
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/acks.html
@@ -0,0 +1,46 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+<html>
+ <head>
+ <title>Acknowledgements</title>
+ <meta name="GENERATOR" content="Microsoft Visual Studio .NET 7.1">
+ <meta name="vs_targetSchema" content="http://schemas.microsoft.com/intellisense/ie5">
+ </head>
+<body>
+<h1>Acknowledgements</h1>
+
+
+<ol>
+ <li>This library was written at the <a href = "http://www.haifa.il.ibm.com/dept/storage/network.html">Network Storage Technologies</a> Group of
+<a href = "http://www.haifa.il.ibm.com/">IBM's Haifa Research Labs</a>.</li>
+ <li>The library is based heavily on policy-based design and uses many useful
+techniques from [<a href="references.html#knuth98sorting">alexandrescu01modern</a>].
+ </li>
+ <li> Two ideas are borrowed from the SGI-STL implementation [<a href = "references.html#sgi_stl">sgi_stl</a>]:
+ <ol>
+ <li>
+ The prime-based resize policies use a list of primes taken from the SGI-STL implementation.
+ </li>
+ <li> The red-black trees contain both a root node and a header
+ node (containing metadata), connected in a way
+ that forward and reverse iteration can be performed efficiently.
+ </li>
+ </ol>
+ </li>
+ <li> Some test utilities borrow ideas from [<a href = "references.html#boost_timer">boost_timer</a>].
+ </li>
+ <li> We would like to thank Scott Meyers for useful comments (without attributing to him
+ any flaws in the design or implementation of the library).
+ </li>
+ <li> Much of the documentation is
+<a href = "http://www.python.org/">
+<img src="PythonPoweredSmall.gif" align=top width=55
+ height=22 alt="[Python Powered]" border=0>
+</a>.
+ </li>
+</ol>
+
+
+
+</body>
+
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/balls_and_bins.jpg b/libstdc++-v3/docs/html/ext/pb_assoc/balls_and_bins.jpg
new file mode 100644
index 0000000..d9f7e8b
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/balls_and_bins.jpg
Binary files differ
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/basic_assoc_cntnr.html b/libstdc++-v3/docs/html/ext/pb_assoc/basic_assoc_cntnr.html
new file mode 100644
index 0000000..ca91c33
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/basic_assoc_cntnr.html
@@ -0,0 +1,1229 @@
+
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+
+
+<html>
+<head>
+<title>basic_assoc_cntnr Interface
+</title>
+
+</head>
+
+<body>
+<h1>
+<tt>basic_assoc_cntnr
+</tt>
+
+ Interface
+
+
+</h1>
+
+<p>A basic associative container, specialized for the &quot;map&quot; case.
+</p>
+
+<ol>
+<li>
+<a href = "../../../../include/ext/pb_assoc/assoc_cntnr.hpp"><tt>assoc_cntnr.hpp</tt>
+</a>
+
+</li>
+
+<li>
+<a href = "#link1">Template parameters.
+</a>
+
+</li>
+
+<li>
+Public Types and Constants:
+
+
+<ol>
+<li>
+<a href = "#link2">General container definitions.
+</a>
+
+</li>
+
+<li>
+<a href = "#link3">Categories.
+</a>
+
+</li>
+
+<li>
+<a href = "#link4">Policy definitions.
+</a>
+
+</li>
+
+<li>
+<a href = "#link5">Key-type definitions.
+</a>
+
+</li>
+
+<li>
+<a href = "#link6">Data-type definitions.
+</a>
+
+</li>
+
+<li>
+<a href = "#link7">Value-type definitions.
+</a>
+
+</li>
+
+<li>
+<a href = "#link8">Iterator definitions.
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+<li>
+Public Methods:
+
+
+<ol>
+<li>
+<a href = "#link9">Constructors, destructor, and related.
+</a>
+
+</li>
+
+<li>
+<a href = "#link10">Information methods.
+</a>
+
+</li>
+
+<li>
+<a href = "#link11">Insert methods.
+</a>
+
+</li>
+
+<li>
+<a href = "#link12">Find methods.
+</a>
+
+</li>
+
+<li>
+<a href = "#link13">Erase methods.
+</a>
+
+</li>
+
+<li>
+<a href = "#link14">Iteration methods.
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+</ol>
+
+
+<h2>
+<a name = "link1">Template parameters.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "20%" ALIGN = "left"><b>Parameter</b></TD><TD Width = "50%" ALIGN = "left"><b>Description</b></TD><TD Width = "30%" ALIGN = "left"><b>Default Value</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "Key3735928856">Key</a></pre>
+
+
+</td>
+
+<td>
+<p>Key type.</p>
+
+
+</td>
+
+<td>
+-
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "Data3735928937">Data</a></pre>
+
+
+</td>
+
+<td>
+<p>Data type.</p>
+
+
+</td>
+
+<td>
+-
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "DS_Tag3735929089">DS_Tag</a></pre>
+
+
+</td>
+
+<td>
+<p>Data structure tag.</p>
+
+
+</td>
+
+<td>
+-
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "Policy_Tl3735929470">Policy_Tl</a></pre>
+
+
+</td>
+
+<td>
+<p>Policy typelist.</p>
+
+
+</td>
+
+<td>
+-
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "Allocator3735929488">Allocator</a></pre>
+
+
+</td>
+
+<td>
+<p>Allocator type.</p>
+
+
+</td>
+
+<td>
+-
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link2">General container definitions.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "30%" ALIGN = "left"><b>Type</b></TD><TD Width = "55%" ALIGN = "left"><b>Definition</b></TD><TD Width = "15%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "size_type3735929547">size_type</a></pre>
+
+
+</td>
+
+<td>
+<pre><b>typename</b> <a href = "#Allocator3735929488">Allocator</a>::size_type</pre>
+
+
+</td>
+
+<td>
+<p>Size type.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "difference_type3735930139">difference_type</a></pre>
+
+
+</td>
+
+<td>
+<pre><b>typename</b> <a href = "#Allocator3735929488">Allocator</a>::difference_type</pre>
+
+
+</td>
+
+<td>
+<p>Difference type.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link3">Categories.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "30%" ALIGN = "left"><b>Type</b></TD><TD Width = "55%" ALIGN = "left"><b>Definition</b></TD><TD Width = "15%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "ds_category3735929731">ds_category</a></pre>
+
+
+</td>
+
+<td>
+<pre><a href = "#DS_Tag3735929089">DS_Tag</a></pre>
+
+
+</td>
+
+<td>
+<p>The underlying data-structure tag of the container. comment = </p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "ms_category3735929740">ms_category</a></pre>
+
+
+</td>
+
+<td>
+<pre><a href = "data_enabled_ms_tag.html"><tt>data_enabled_ms_tag</tt></a></pre>
+
+
+</td>
+
+<td>
+<p>The mapping-semantics category of the container.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link4">Policy definitions.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "30%" ALIGN = "left"><b>Type</b></TD><TD Width = "55%" ALIGN = "left"><b>Definition</b></TD><TD Width = "15%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "allocator3735929520">allocator</a></pre>
+
+
+</td>
+
+<td>
+<pre><a href = "#Allocator3735929488">Allocator</a></pre>
+
+
+</td>
+
+<td>
+<p>Allocator type.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link5">Key-type definitions.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "30%" ALIGN = "left"><b>Type</b></TD><TD Width = "55%" ALIGN = "left"><b>Definition</b></TD><TD Width = "15%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "key_type3735929433">key_type</a></pre>
+
+
+</td>
+
+<td>
+<pre><b>typename</b> <a href = "#allocator3735929520">allocator</a>::<b>template</b> rebind&lt;
+ <a href = "#Key3735928856">Key</a>&gt;::other::value_type</pre>
+
+
+</td>
+
+<td>
+<p>Key type.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "key_reference3735929926">key_reference</a></pre>
+
+
+</td>
+
+<td>
+<pre><b>typename</b> <a href = "#allocator3735929520">allocator</a>::<b>template</b> rebind&lt;
+ <a href = "#Key3735928856">Key</a>&gt;::other::reference</pre>
+
+
+</td>
+
+<td>
+<p>Key reference type.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "const_key_reference3735929552">const_key_reference</a></pre>
+
+
+</td>
+
+<td>
+<pre><b>typename</b> <a href = "#allocator3735929520">allocator</a>::<b>template</b> rebind&lt;
+ <a href = "#Key3735928856">Key</a>&gt;::other::const_reference</pre>
+
+
+</td>
+
+<td>
+<p>Const key reference type.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "key_pointer3735929752">key_pointer</a></pre>
+
+
+</td>
+
+<td>
+<pre><b>typename</b> <a href = "#allocator3735929520">allocator</a>::<b>template</b> rebind&lt;
+ <a href = "#Key3735928856">Key</a>&gt;::other::pointer</pre>
+
+
+</td>
+
+<td>
+<p>Key pointer type.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "const_key_pointer3735929445">const_key_pointer</a></pre>
+
+
+</td>
+
+<td>
+<pre><b>typename</b> <a href = "#allocator3735929520">allocator</a>::<b>template</b> rebind&lt;
+ <a href = "#Key3735928856">Key</a>&gt;::other::const_pointer</pre>
+
+
+</td>
+
+<td>
+<p>Const key pointer type.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link6">Data-type definitions.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "30%" ALIGN = "left"><b>Type</b></TD><TD Width = "55%" ALIGN = "left"><b>Definition</b></TD><TD Width = "15%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "data_type3735929514">data_type</a></pre>
+
+
+</td>
+
+<td>
+<pre><b>typename</b> <a href = "#allocator3735929520">allocator</a>::<b>template</b> rebind&lt;
+ <a href = "#Data3735928937">Data</a>&gt;::other::value_type</pre>
+
+
+</td>
+
+<td>
+<p>Data type.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "data_reference3735930007">data_reference</a></pre>
+
+
+</td>
+
+<td>
+<pre><b>typename</b> <a href = "#allocator3735929520">allocator</a>::<b>template</b> rebind&lt;
+ <a href = "#Data3735928937">Data</a>&gt;::other::reference</pre>
+
+
+</td>
+
+<td>
+<p>Data reference type.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "const_data_reference3735929597">const_data_reference</a></pre>
+
+
+</td>
+
+<td>
+<pre><b>typename</b> <a href = "#allocator3735929520">allocator</a>::<b>template</b> rebind&lt;
+ <a href = "#Data3735928937">Data</a>&gt;::other::const_reference</pre>
+
+
+</td>
+
+<td>
+<p>Const data reference type.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "data_pointer3735929833">data_pointer</a></pre>
+
+
+</td>
+
+<td>
+<pre><b>typename</b> <a href = "#allocator3735929520">allocator</a>::<b>template</b> rebind&lt;
+ <a href = "#Data3735928937">Data</a>&gt;::other::pointer</pre>
+
+
+</td>
+
+<td>
+<p>Data pointer type.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "const_data_pointer3735929517">const_data_pointer</a></pre>
+
+
+</td>
+
+<td>
+<pre><b>typename</b> <a href = "#allocator3735929520">allocator</a>::<b>template</b> rebind&lt;
+ <a href = "#Data3735928937">Data</a>&gt;::other::const_pointer</pre>
+
+
+</td>
+
+<td>
+<p>Const data pointer type.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link7">Value-type definitions.
+</a>
+
+</h2>
+
+<p><p>Types pertaining to the <b>domain</b> of the relationships of the table.</p> <p>This is explained in <a href = "concepts.html#concepts_types">Data Types, Value Types, Mapped Data Types, and Mapped Value Types</a> and <a href = "non_unique_mapping.html#types">Mapped Data Types and Mapped Value Types</a>.</p></p>
+
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "30%" ALIGN = "left"><b>Type</b></TD><TD Width = "55%" ALIGN = "left"><b>Definition</b></TD><TD Width = "15%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "value_type3735929645">value_type</a></pre>
+
+
+</td>
+
+<td>
+<pre><b>typename</b> <a href = "#allocator3735929520">allocator</a>::rebind&lt;
+ std::pair&lt;<b>const</b> <a href = "#key_type3735929433">key_type</a>, <a href = "#data_type3735929514">data_type</a>&gt; &gt;::other::value_type</pre>
+
+
+</td>
+
+<td>
+<p>Data type.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "reference3735929502">reference</a></pre>
+
+
+</td>
+
+<td>
+<pre><b>typename</b> <a href = "#allocator3735929520">allocator</a>::rebind&lt;
+ std::pair&lt;<b>const</b> <a href = "#key_type3735929433">key_type</a>, <a href = "#data_type3735929514">data_type</a>&gt; &gt;::other::reference</pre>
+
+
+</td>
+
+<td>
+<p>Value reference type.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "const_reference3735930148">const_reference</a></pre>
+
+
+</td>
+
+<td>
+<pre><b>typename</b> <a href = "#allocator3735929520">allocator</a>::rebind&lt;
+ std::pair&lt;<b>const</b> <a href = "#key_type3735929433">key_type</a>, <a href = "#data_type3735929514">data_type</a>&gt; &gt;::other::const_reference</pre>
+
+
+</td>
+
+<td>
+<p>Const value reference type.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "pointer3735929328">pointer</a></pre>
+
+
+</td>
+
+<td>
+<pre><b>typename</b> <a href = "#allocator3735929520">allocator</a>::rebind&lt;
+ std::pair&lt;<b>const</b> <a href = "#key_type3735929433">key_type</a>, <a href = "#data_type3735929514">data_type</a>&gt; &gt;::other::pointer</pre>
+
+
+</td>
+
+<td>
+<p>Value pointer type.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "const_pointer3735929974">const_pointer</a></pre>
+
+
+</td>
+
+<td>
+<pre><b>typename</b> <a href = "#allocator3735929520">allocator</a>::rebind&lt;
+ std::pair&lt;<b>const</b> <a href = "#key_type3735929433">key_type</a>, <a href = "#data_type3735929514">data_type</a>&gt; &gt;::other::const_pointer</pre>
+
+
+</td>
+
+<td>
+<p>Const Value pointer type.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link8">Iterator definitions.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "30%" ALIGN = "left"><b>Type</b></TD><TD Width = "55%" ALIGN = "left"><b>Definition</b></TD><TD Width = "15%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "const_find_iterator3735929537">const_find_iterator</a></pre>
+
+
+</td>
+
+<td>
+<pre>Underlying data-structure's const find-type iterator.</pre>
+
+
+</td>
+
+<td>
+<p>Const find-type iterator.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "find_iterator3735929945">find_iterator</a></pre>
+
+
+</td>
+
+<td>
+<pre>Underlying data-structure's find-type iterator.</pre>
+
+
+</td>
+
+<td>
+<p>Find-type iterator.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "const_iterator3735930079">const_iterator</a></pre>
+
+
+</td>
+
+<td>
+<pre>Underlying data-structure's const range-type iterator.</pre>
+
+
+</td>
+
+<td>
+<p>Const range-type iterator.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "iterator3735929433">iterator</a></pre>
+
+
+</td>
+
+<td>
+<pre>Underlying data-structure's range-type iterator.</pre>
+
+
+</td>
+
+<td>
+<p>Range-type iterator.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link9">Constructors, destructor, and related.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>virtual</b>
+ ~basic_assoc_cntnr
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Destructor.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link10">Information methods.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>inline</b> <a href = "#size_type3735929547">size_type</a>
+ size
+ () <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Returns the number of distinct <a href = "#value_type3735929645"><tt>value_type</tt></a> objects the container object is storing.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <a href = "#size_type3735929547">size_type</a>
+ max_size
+ () <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Returns an upper bound on the number of distinct <a href = "#value_type3735929645"><tt>value_type</tt></a> objects this container can store.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <b>bool</b>
+ empty
+ () <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Returns whether the container object is not storing any <a href = "#value_type3735929645"><tt>value_type</tt></a> objects.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> static <a href = "#const_key_reference3735929552">const_key_reference</a>
+ extract_key
+ (<a href = "#const_reference3735930148">const_reference</a> r_val)</pre>
+
+
+</td>
+
+<td>
+<p>Extracts a key from a <a href = "#value_type3735929645"><tt>value_type</tt></a>.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link11">Insert methods.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>inline</b> std::pair&lt;<a href = "#find_iterator3735929945">find_iterator</a>, <b>bool</b>&gt;
+ insert
+ (<a href = "#const_reference3735930148">const_reference</a> r_val)</pre>
+
+
+</td>
+
+<td>
+<p>Inserts a <a href = "#value_type3735929645"><tt>value_type</tt></a> object. If no <a href = "#value_type3735929645"><tt>value_type</tt></a> with <font color = "#666666"><tt>r_val</tt></font>'s key was in the container object, inserts and returns (<a href = "#find_iterator3735929945"><tt>find_iterator</tt></a> object associated with <font color = "#666666"><tt>r_val</tt></font>, <tt><b>true</b></tt>); otherwise just returns (<a href = "#find_iterator3735929945"><tt>find_iterator</tt></a> object associated with <font color = "#666666"><tt>r_val</tt></font>'s key, <tt><b>false</b></tt>).</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <a href = "#data_reference3735930007">data_reference</a>
+ <b>operator</b>[]
+ (<a href = "#const_key_reference3735929552">const_key_reference</a> r_key)</pre>
+
+
+</td>
+
+<td>
+<p>Inserts (if necessary) a <a href = "#value_type3735929645"><tt>value_type</tt></a> object associated with <font color = "#666666"><tt>r_key</tt></font>. Returns a <a href = "#data_reference3735930007"><tt>data_reference</tt></a> associated with <font color = "#666666"><tt>r_key</tt></font></p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link12">Find methods.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>inline</b> <a href = "#find_iterator3735929945">find_iterator</a>
+ find
+ (<a href = "#const_key_reference3735929552">const_key_reference</a> r_key)</pre>
+
+
+</td>
+
+<td>
+<p>Returns the <a href = "#find_iterator3735929945"><tt>find_iterator</tt></a> corresponding to the <a href = "#value_type3735929645"><tt>value_type</tt></a> with <font color = "#666666"><tt>r_key</tt></font> as its key, or the <a href = "#find_iterator3735929945"><tt>find_iterator</tt></a> corresponding to the just-after-last entry if no such <a href = "#value_type3735929645"><tt>value_type</tt></a>.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <a href = "#const_find_iterator3735929537">const_find_iterator</a>
+ find
+ (<a href = "#const_key_reference3735929552">const_key_reference</a> r_key) <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Returns the <a href = "#const_find_iterator3735929537"><tt>const_find_iterator</tt></a> corresponding to the <a href = "#value_type3735929645"><tt>value_type</tt></a> with <font color = "#666666"><tt>r_key</tt></font> as its key, or the <a href = "#const_find_iterator3735929537"><tt>const_find_iterator</tt></a> corresponding to the just-after-last entry if no such <a href = "#value_type3735929645"><tt>value_type</tt></a>.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <a href = "#const_data_reference3735929597">const_data_reference</a>
+ <b>operator</b>[]
+ (<a href = "#const_key_reference3735929552">const_key_reference</a> r_key) <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Inserts (if necessary) a <a href = "#value_type3735929645"><tt>value_type</tt></a> object associated with <font color = "#666666"><tt>r_key</tt></font>. Returns a <a href = "#data_reference3735930007"><tt>data_reference</tt></a> associated with <font color = "#666666"><tt>r_key</tt></font></p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link13">Erase methods.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>inline</b> <a href = "#size_type3735929547">size_type</a>
+ erase
+ (<a href = "#const_key_reference3735929552">const_key_reference</a> r_key)</pre>
+
+
+</td>
+
+<td>
+<p>Erases the <a href = "#value_type3735929645"><tt>value_type</tt></a> associated with <font color = "#666666"><tt>r_key</tt></font>; returns the number of <a href = "#value_type3735929645"><tt>value_type</tt></a>s erased (0 or 1).</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>template</b>&lt;
+ <b>class</b> Pred&gt;
+<b>inline</b> <a href = "#size_type3735929547">size_type</a>
+ erase_if
+ (Pred prd)</pre>
+
+
+</td>
+
+<td>
+<p>Erases any <a href = "#value_type3735929645"><tt>value_type</tt></a> satisfying the predicate <font color = "#666666"><tt>prd</tt></font> (this is transactional, either all matching <a href = "#value_type3735929645"><tt>value_type</tt></a>s are erased, or, if an exception is thrown (for types whose erase can throw an exception) none); returns the number of <a href = "#value_type3735929645"><tt>value_type</tt></a>s erased.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>void</b>
+ clear
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Clears the container object.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link14">Iteration methods.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>inline</b> <a href = "#iterator3735929433">iterator</a>
+ begin
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Returns an <a href = "#iterator3735929433"><tt>iterator</tt></a> corresponding to the first <a href = "#value_type3735929645"><tt>value_type</tt></a> in the container.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <a href = "#const_iterator3735930079">const_iterator</a>
+ begin
+ () <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Returns a <a href = "#const_iterator3735930079"><tt>const_iterator</tt></a> corresponding to the first <a href = "#value_type3735929645"><tt>value_type</tt></a> in the container.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <a href = "#iterator3735929433">iterator</a>
+ end
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Returns an <a href = "#iterator3735929433"><tt>iterator</tt></a> corresponding to the just-after_last <a href = "#value_type3735929645"><tt>value_type</tt></a> in the container.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <a href = "#const_iterator3735930079">const_iterator</a>
+ end
+ () <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Returns a <a href = "#const_iterator3735930079"><tt>const_iterator</tt></a> corresponding to the just-after_last <a href = "#value_type3735929645"><tt>value_type</tt></a> in the container.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+
+
+</body>
+
+</html>
+
+
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/basic_assoc_cntnr_compound_data.html b/libstdc++-v3/docs/html/ext/pb_assoc/basic_assoc_cntnr_compound_data.html
new file mode 100644
index 0000000..4cde4db
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/basic_assoc_cntnr_compound_data.html
@@ -0,0 +1,1244 @@
+
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+
+
+<html>
+<head>
+<title>basic_assoc_cntnr Interface
+</title>
+
+</head>
+
+<body>
+<h1>
+<tt>basic_assoc_cntnr
+</tt>
+
+ Interface
+
+
+</h1>
+
+<p>A basic associative container specialized for the &quot;multimap&quot; case.
+</p>
+
+<ol>
+<li>
+<a href = "../../../../include/ext/pb_assoc/assoc_cntnr.hpp"><tt>assoc_cntnr.hpp</tt>
+</a>
+
+</li>
+
+<li>
+<a href = "#link1">Template parameters.
+</a>
+
+</li>
+
+<li>
+Public Types and Constants:
+
+
+<ol>
+<li>
+<a href = "#link2">General container definitions.
+</a>
+
+</li>
+
+<li>
+<a href = "#link3">Categories.
+</a>
+
+</li>
+
+<li>
+<a href = "#link4">Policy definitions.
+</a>
+
+</li>
+
+<li>
+<a href = "#link5">Key-type definitions.
+</a>
+
+</li>
+
+<li>
+<a href = "#link6">Data-type definitions.
+</a>
+
+</li>
+
+<li>
+<a href = "#link7">Value-type definitions.
+</a>
+
+</li>
+
+<li>
+<a href = "#link8">Iterator definitions.
+</a>
+
+</li>
+
+<li>
+<a href = "#link9">Mapping-level definitions.
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+<li>
+Public Methods:
+
+
+<ol>
+<li>
+<a href = "#link10">Constructors, destructor, and related.
+</a>
+
+</li>
+
+<li>
+<a href = "#link11">Information methods.
+</a>
+
+</li>
+
+<li>
+<a href = "#link12">Insert methods.
+</a>
+
+</li>
+
+<li>
+<a href = "#link13">Find methods.
+</a>
+
+</li>
+
+<li>
+<a href = "#link14">Erase methods.
+</a>
+
+</li>
+
+<li>
+<a href = "#link15">Iteration methods.
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+</ol>
+
+
+<h2>
+<a name = "link1">Template parameters.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "20%" ALIGN = "left"><b>Parameter</b></TD><TD Width = "50%" ALIGN = "left"><b>Description</b></TD><TD Width = "30%" ALIGN = "left"><b>Default Value</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "Key3735928856">Key</a></pre>
+
+
+</td>
+
+<td>
+<p>Key type.</p>
+
+
+</td>
+
+<td>
+-
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "Cntnr3735929076">Cntnr</a></pre>
+
+
+</td>
+
+<td>
+<p>(Associative) container to which each data is mapped.</p>
+
+
+</td>
+
+<td>
+-
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "DS_Tag3735929089">DS_Tag</a></pre>
+
+
+</td>
+
+<td>
+<p>Data structure tag.</p>
+
+
+</td>
+
+<td>
+-
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "Policy_Tl3735929470">Policy_Tl</a></pre>
+
+
+</td>
+
+<td>
+<p>Policy typelist.</p>
+
+
+</td>
+
+<td>
+-
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "Allocator3735929488">Allocator</a></pre>
+
+
+</td>
+
+<td>
+<p>Allocator type.</p>
+
+
+</td>
+
+<td>
+-
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link2">General container definitions.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "30%" ALIGN = "left"><b>Type</b></TD><TD Width = "55%" ALIGN = "left"><b>Definition</b></TD><TD Width = "15%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "size_type3735929547">size_type</a></pre>
+
+
+</td>
+
+<td>
+<pre><b>typename</b> <a href = "#Allocator3735929488">Allocator</a>::size_type</pre>
+
+
+</td>
+
+<td>
+<p>Size type.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "difference_type3735930139">difference_type</a></pre>
+
+
+</td>
+
+<td>
+<pre><b>typename</b> <a href = "#Allocator3735929488">Allocator</a>::difference_type</pre>
+
+
+</td>
+
+<td>
+<p>Difference type.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link3">Categories.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "30%" ALIGN = "left"><b>Type</b></TD><TD Width = "55%" ALIGN = "left"><b>Definition</b></TD><TD Width = "15%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "ds_category3735929731">ds_category</a></pre>
+
+
+</td>
+
+<td>
+<pre><a href = "#DS_Tag3735929089">DS_Tag</a></pre>
+
+
+</td>
+
+<td>
+<p>The underlying data-structure tag of the container. comment = </p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "ms_category3735929740">ms_category</a></pre>
+
+
+</td>
+
+<td>
+<pre><a href = "compound_data_enabled_ms_tag.html"><tt>compound_data_enabled_ms_tag</tt></a></pre>
+
+
+</td>
+
+<td>
+<p>The mapping-semantics category of the container. override_from = </p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link4">Policy definitions.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "30%" ALIGN = "left"><b>Type</b></TD><TD Width = "55%" ALIGN = "left"><b>Definition</b></TD><TD Width = "15%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "allocator3735929520">allocator</a></pre>
+
+
+</td>
+
+<td>
+<pre><a href = "#Allocator3735929488">Allocator</a></pre>
+
+
+</td>
+
+<td>
+<p>Allocator type.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link5">Key-type definitions.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "30%" ALIGN = "left"><b>Type</b></TD><TD Width = "55%" ALIGN = "left"><b>Definition</b></TD><TD Width = "15%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "key_type3735929433">key_type</a></pre>
+
+
+</td>
+
+<td>
+<pre><b>typename</b> <a href = "#allocator3735929520">allocator</a>::<b>template</b> rebind&lt;
+ <a href = "#Key3735928856">Key</a>&gt;::other::value_type</pre>
+
+
+</td>
+
+<td>
+<p>Key type.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "key_reference3735929926">key_reference</a></pre>
+
+
+</td>
+
+<td>
+<pre><b>typename</b> <a href = "#allocator3735929520">allocator</a>::<b>template</b> rebind&lt;
+ <a href = "#Key3735928856">Key</a>&gt;::other::reference</pre>
+
+
+</td>
+
+<td>
+<p>Key reference type.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "const_key_reference3735929552">const_key_reference</a></pre>
+
+
+</td>
+
+<td>
+<pre><b>typename</b> <a href = "#allocator3735929520">allocator</a>::<b>template</b> rebind&lt;
+ <a href = "#Key3735928856">Key</a>&gt;::other::const_reference</pre>
+
+
+</td>
+
+<td>
+<p>Const key reference type.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "key_pointer3735929752">key_pointer</a></pre>
+
+
+</td>
+
+<td>
+<pre><b>typename</b> <a href = "#allocator3735929520">allocator</a>::<b>template</b> rebind&lt;
+ <a href = "#Key3735928856">Key</a>&gt;::other::pointer</pre>
+
+
+</td>
+
+<td>
+<p>Key pointer type.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "const_key_pointer3735929445">const_key_pointer</a></pre>
+
+
+</td>
+
+<td>
+<pre><b>typename</b> <a href = "#allocator3735929520">allocator</a>::<b>template</b> rebind&lt;
+ <a href = "#Key3735928856">Key</a>&gt;::other::const_pointer</pre>
+
+
+</td>
+
+<td>
+<p>Const key pointer type.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link6">Data-type definitions.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "30%" ALIGN = "left"><b>Type</b></TD><TD Width = "55%" ALIGN = "left"><b>Definition</b></TD><TD Width = "15%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "data_type3735929514">data_type</a></pre>
+
+
+</td>
+
+<td>
+<pre><b>typename</b> <a href = "#allocator3735929520">allocator</a>::<b>template</b> rebind&lt;
+ <a href = "#Cntnr3735929076">Cntnr</a>&gt;::other::value_type</pre>
+
+
+</td>
+
+<td>
+<p>Data type.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "data_reference3735930007">data_reference</a></pre>
+
+
+</td>
+
+<td>
+<pre><b>typename</b> <a href = "#allocator3735929520">allocator</a>::<b>template</b> rebind&lt;
+ <a href = "#Cntnr3735929076">Cntnr</a>&gt;::other::reference</pre>
+
+
+</td>
+
+<td>
+<p>Data reference type.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "const_data_reference3735929597">const_data_reference</a></pre>
+
+
+</td>
+
+<td>
+<pre><b>typename</b> <a href = "#allocator3735929520">allocator</a>::<b>template</b> rebind&lt;
+ <a href = "#Cntnr3735929076">Cntnr</a>&gt;::other::const_reference</pre>
+
+
+</td>
+
+<td>
+<p>Const data reference type.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "data_pointer3735929833">data_pointer</a></pre>
+
+
+</td>
+
+<td>
+<pre><b>typename</b> <a href = "#allocator3735929520">allocator</a>::<b>template</b> rebind&lt;
+ <a href = "#Cntnr3735929076">Cntnr</a>&gt;::other::pointer</pre>
+
+
+</td>
+
+<td>
+<p>Data pointer type.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "const_data_pointer3735929517">const_data_pointer</a></pre>
+
+
+</td>
+
+<td>
+<pre><b>typename</b> <a href = "#allocator3735929520">allocator</a>::<b>template</b> rebind&lt;
+ <a href = "#Cntnr3735929076">Cntnr</a>&gt;::other::const_pointer</pre>
+
+
+</td>
+
+<td>
+<p>Const data pointer type.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link7">Value-type definitions.
+</a>
+
+</h2>
+
+<p><p>Types pertaining to the <b>domain</b> of the relationships of the table.</p> <p>This is explained in <a href = "concepts.html#concepts_types">Data Types, Value Types, Mapped Data Types, and Mapped Value Types</a> and <a href = "non_unique_mapping.html#types">Mapped Data Types and Mapped Value Types</a>.</p></p>
+
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "30%" ALIGN = "left"><b>Type</b></TD><TD Width = "55%" ALIGN = "left"><b>Definition</b></TD><TD Width = "15%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "value_type3735929645">value_type</a></pre>
+
+
+</td>
+
+<td>
+<pre><b>typename</b> <a href = "#allocator3735929520">allocator</a>::rebind&lt;
+ std::pair&lt;<b>const</b> <a href = "#key_type3735929433">key_type</a>, <a href = "#Cntnr3735929076">Cntnr</a>&gt;::other::value_type</pre>
+
+
+</td>
+
+<td>
+<p>Data type.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "reference3735929502">reference</a></pre>
+
+
+</td>
+
+<td>
+<pre><b>typename</b> <a href = "#allocator3735929520">allocator</a>::rebind&lt;
+ std::pair&lt;<b>const</b> <a href = "#key_type3735929433">key_type</a>, <a href = "#Cntnr3735929076">Cntnr</a>&gt;::other::reference</pre>
+
+
+</td>
+
+<td>
+<p>Value reference type.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "const_reference3735930148">const_reference</a></pre>
+
+
+</td>
+
+<td>
+<pre><b>typename</b> <a href = "#allocator3735929520">allocator</a>::rebind&lt;
+ std::pair&lt;<b>const</b> <a href = "#key_type3735929433">key_type</a>, <a href = "#Cntnr3735929076">Cntnr</a>&gt;::other::const_reference</pre>
+
+
+</td>
+
+<td>
+<p>Const value reference type.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "pointer3735929328">pointer</a></pre>
+
+
+</td>
+
+<td>
+<pre><b>typename</b> <a href = "#allocator3735929520">allocator</a>::rebind&lt;
+ std::pair&lt;<b>const</b> <a href = "#key_type3735929433">key_type</a>, <a href = "#Cntnr3735929076">Cntnr</a>&gt;::other::pointer</pre>
+
+
+</td>
+
+<td>
+<p>Value pointer type.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "const_pointer3735929974">const_pointer</a></pre>
+
+
+</td>
+
+<td>
+<pre><b>typename</b> <a href = "#allocator3735929520">allocator</a>::rebind&lt;
+ std::pair&lt;<b>const</b> <a href = "#key_type3735929433">key_type</a>, <a href = "#Cntnr3735929076">Cntnr</a>&gt;::other::const_pointer</pre>
+
+
+</td>
+
+<td>
+<p>Const Value pointer type.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link8">Iterator definitions.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "30%" ALIGN = "left"><b>Type</b></TD><TD Width = "55%" ALIGN = "left"><b>Definition</b></TD><TD Width = "15%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "const_find_iterator3735929537">const_find_iterator</a></pre>
+
+
+</td>
+
+<td>
+<pre>Underlying data-structure's const find-type iterator.</pre>
+
+
+</td>
+
+<td>
+<p>Const find-type iterator.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "find_iterator3735929945">find_iterator</a></pre>
+
+
+</td>
+
+<td>
+<pre>Underlying data-structure's find-type iterator.</pre>
+
+
+</td>
+
+<td>
+<p>Find-type iterator.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "const_iterator3735930079">const_iterator</a></pre>
+
+
+</td>
+
+<td>
+<pre>Underlying data-structure's const range-type iterator.</pre>
+
+
+</td>
+
+<td>
+<p>Const range-type iterator.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "iterator3735929433">iterator</a></pre>
+
+
+</td>
+
+<td>
+<pre>Underlying data-structure's range-type iterator.</pre>
+
+
+</td>
+
+<td>
+<p>Range-type iterator.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link9">Mapping-level definitions.
+</a>
+
+</h2>
+
+<p>See <a href = "ms_gen.html">Mapping-Semantics</a>.</p>
+
+
+<h2>
+<a name = "link10">Constructors, destructor, and related.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>virtual</b>
+ ~basic_assoc_cntnr
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Destructor.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link11">Information methods.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>inline</b> <a href = "#size_type3735929547">size_type</a>
+ size
+ () <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Returns the number of distinct <a href = "#value_type3735929645"><tt>value_type</tt></a> objects the container object is storing.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <a href = "#size_type3735929547">size_type</a>
+ max_size
+ () <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Returns an upper bound on the number of distinct <a href = "#value_type3735929645"><tt>value_type</tt></a> objects this container can store.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <b>bool</b>
+ empty
+ () <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Returns whether the container object is not storing any <a href = "#value_type3735929645"><tt>value_type</tt></a> objects.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> static <a href = "#const_key_reference3735929552">const_key_reference</a>
+ extract_key
+ (<a href = "#const_reference3735930148">const_reference</a> r_val)</pre>
+
+
+</td>
+
+<td>
+<p>Extracts a key from a <a href = "#value_type3735929645"><tt>value_type</tt></a>.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link12">Insert methods.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>inline</b> std::pair&lt;<a href = "#find_iterator3735929945">find_iterator</a>, <b>bool</b>&gt;
+ insert
+ (<a href = "#const_reference3735930148">const_reference</a> r_val)</pre>
+
+
+</td>
+
+<td>
+<p>Inserts a <a href = "#value_type3735929645"><tt>value_type</tt></a> object. If no <a href = "#value_type3735929645"><tt>value_type</tt></a> with <font color = "#666666"><tt>r_val</tt></font>'s key was in the container object, inserts and returns (<a href = "#find_iterator3735929945"><tt>find_iterator</tt></a> object associated with <font color = "#666666"><tt>r_val</tt></font>, <tt><b>true</b></tt>); otherwise just returns (<a href = "#find_iterator3735929945"><tt>find_iterator</tt></a> object associated with <font color = "#666666"><tt>r_val</tt></font>'s key, <tt><b>false</b></tt>).</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <a href = "#data_reference3735930007">data_reference</a>
+ <b>operator</b>[]
+ (<a href = "#const_key_reference3735929552">const_key_reference</a> r_key)</pre>
+
+
+</td>
+
+<td>
+<p>Inserts (if necessary) a <a href = "#value_type3735929645"><tt>value_type</tt></a> object associated with <font color = "#666666"><tt>r_key</tt></font>. Returns a <a href = "#data_reference3735930007"><tt>data_reference</tt></a> associated with <font color = "#666666"><tt>r_key</tt></font></p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link13">Find methods.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>inline</b> <a href = "#find_iterator3735929945">find_iterator</a>
+ find
+ (<a href = "#const_key_reference3735929552">const_key_reference</a> r_key)</pre>
+
+
+</td>
+
+<td>
+<p>Returns the <a href = "#find_iterator3735929945"><tt>find_iterator</tt></a> corresponding to the <a href = "#value_type3735929645"><tt>value_type</tt></a> with <font color = "#666666"><tt>r_key</tt></font> as its key, or the <a href = "#find_iterator3735929945"><tt>find_iterator</tt></a> corresponding to the just-after-last entry if no such <a href = "#value_type3735929645"><tt>value_type</tt></a>.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <a href = "#const_find_iterator3735929537">const_find_iterator</a>
+ find
+ (<a href = "#const_key_reference3735929552">const_key_reference</a> r_key) <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Returns the <a href = "#const_find_iterator3735929537"><tt>const_find_iterator</tt></a> corresponding to the <a href = "#value_type3735929645"><tt>value_type</tt></a> with <font color = "#666666"><tt>r_key</tt></font> as its key, or the <a href = "#const_find_iterator3735929537"><tt>const_find_iterator</tt></a> corresponding to the just-after-last entry if no such <a href = "#value_type3735929645"><tt>value_type</tt></a>.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <a href = "#const_data_reference3735929597">const_data_reference</a>
+ <b>operator</b>[]
+ (<a href = "#const_key_reference3735929552">const_key_reference</a> r_key) <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Inserts (if necessary) a <a href = "#value_type3735929645"><tt>value_type</tt></a> object associated with <font color = "#666666"><tt>r_key</tt></font>. Returns a <a href = "#data_reference3735930007"><tt>data_reference</tt></a> associated with <font color = "#666666"><tt>r_key</tt></font></p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link14">Erase methods.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>inline</b> <a href = "#size_type3735929547">size_type</a>
+ erase
+ (<a href = "#const_key_reference3735929552">const_key_reference</a> r_key)</pre>
+
+
+</td>
+
+<td>
+<p>Erases the <a href = "#value_type3735929645"><tt>value_type</tt></a> associated with <font color = "#666666"><tt>r_key</tt></font>; returns the number of <a href = "#value_type3735929645"><tt>value_type</tt></a>s erased (0 or 1).</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>template</b>&lt;
+ <b>class</b> Pred&gt;
+<b>inline</b> <a href = "#size_type3735929547">size_type</a>
+ erase_if
+ (Pred prd)</pre>
+
+
+</td>
+
+<td>
+<p>Erases any <a href = "#value_type3735929645"><tt>value_type</tt></a> satisfying the predicate <font color = "#666666"><tt>prd</tt></font> (this is transactional, either all matching <a href = "#value_type3735929645"><tt>value_type</tt></a>s are erased, or, if an exception is thrown (for types whose erase can throw an exception) none); returns the number of <a href = "#value_type3735929645"><tt>value_type</tt></a>s erased.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>void</b>
+ clear
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Clears the container object.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link15">Iteration methods.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>inline</b> <a href = "#iterator3735929433">iterator</a>
+ begin
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Returns an <a href = "#iterator3735929433"><tt>iterator</tt></a> corresponding to the first <a href = "#value_type3735929645"><tt>value_type</tt></a> in the container.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <a href = "#const_iterator3735930079">const_iterator</a>
+ begin
+ () <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Returns a <a href = "#const_iterator3735930079"><tt>const_iterator</tt></a> corresponding to the first <a href = "#value_type3735929645"><tt>value_type</tt></a> in the container.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <a href = "#iterator3735929433">iterator</a>
+ end
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Returns an <a href = "#iterator3735929433"><tt>iterator</tt></a> corresponding to the just-after_last <a href = "#value_type3735929645"><tt>value_type</tt></a> in the container.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <a href = "#const_iterator3735930079">const_iterator</a>
+ end
+ () <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Returns a <a href = "#const_iterator3735930079"><tt>const_iterator</tt></a> corresponding to the just-after_last <a href = "#value_type3735929645"><tt>value_type</tt></a> in the container.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+
+
+</body>
+
+</html>
+
+
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/basic_assoc_cntnr_no_data.html b/libstdc++-v3/docs/html/ext/pb_assoc/basic_assoc_cntnr_no_data.html
new file mode 100644
index 0000000..8dd0a39
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/basic_assoc_cntnr_no_data.html
@@ -0,0 +1,1046 @@
+
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+
+
+<html>
+<head>
+<title>basic_assoc_cntnr Interface
+</title>
+
+</head>
+
+<body>
+<h1>
+<tt>basic_assoc_cntnr
+</tt>
+
+ Interface
+
+
+</h1>
+
+<p>A basic associative container specialized for the &quot;set&quot; case.
+</p>
+
+<ol>
+<li>
+<a href = "../../../../include/ext/pb_assoc/assoc_cntnr.hpp"><tt>assoc_cntnr.hpp</tt>
+</a>
+
+</li>
+
+<li>
+<a href = "#link1">Template parameters.
+</a>
+
+</li>
+
+<li>
+Public Types and Constants:
+
+
+<ol>
+<li>
+<a href = "#link2">General container definitions.
+</a>
+
+</li>
+
+<li>
+<a href = "#link3">Categories.
+</a>
+
+</li>
+
+<li>
+<a href = "#link4">Policy definitions.
+</a>
+
+</li>
+
+<li>
+<a href = "#link5">Key-type definitions.
+</a>
+
+</li>
+
+<li>
+<a href = "#link6">Value-type definitions.
+</a>
+
+</li>
+
+<li>
+<a href = "#link7">Iterator definitions.
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+<li>
+Public Methods:
+
+
+<ol>
+<li>
+<a href = "#link8">Constructors, destructor, and related.
+</a>
+
+</li>
+
+<li>
+<a href = "#link9">Information methods.
+</a>
+
+</li>
+
+<li>
+<a href = "#link10">Insert methods.
+</a>
+
+</li>
+
+<li>
+<a href = "#link11">Find methods.
+</a>
+
+</li>
+
+<li>
+<a href = "#link12">Erase methods.
+</a>
+
+</li>
+
+<li>
+<a href = "#link13">Iteration methods.
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+</ol>
+
+
+<h2>
+<a name = "link1">Template parameters.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "20%" ALIGN = "left"><b>Parameter</b></TD><TD Width = "50%" ALIGN = "left"><b>Description</b></TD><TD Width = "30%" ALIGN = "left"><b>Default Value</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "Key3735928856">Key</a></pre>
+
+
+</td>
+
+<td>
+<p>Key type.</p>
+
+
+</td>
+
+<td>
+-
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "DS_Tag3735929089">DS_Tag</a></pre>
+
+
+</td>
+
+<td>
+<p>Data structure tag.</p>
+
+
+</td>
+
+<td>
+-
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "Policy_Tl3735929470">Policy_Tl</a></pre>
+
+
+</td>
+
+<td>
+<p>Policy typelist.</p>
+
+
+</td>
+
+<td>
+-
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "Allocator3735929488">Allocator</a></pre>
+
+
+</td>
+
+<td>
+<p>Allocator type.</p>
+
+
+</td>
+
+<td>
+-
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link2">General container definitions.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "30%" ALIGN = "left"><b>Type</b></TD><TD Width = "55%" ALIGN = "left"><b>Definition</b></TD><TD Width = "15%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "size_type3735929547">size_type</a></pre>
+
+
+</td>
+
+<td>
+<pre><b>typename</b> <a href = "#Allocator3735929488">Allocator</a>::size_type</pre>
+
+
+</td>
+
+<td>
+<p>Size type.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "difference_type3735930139">difference_type</a></pre>
+
+
+</td>
+
+<td>
+<pre><b>typename</b> <a href = "#Allocator3735929488">Allocator</a>::difference_type</pre>
+
+
+</td>
+
+<td>
+<p>Difference type.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link3">Categories.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "30%" ALIGN = "left"><b>Type</b></TD><TD Width = "55%" ALIGN = "left"><b>Definition</b></TD><TD Width = "15%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "ds_category3735929731">ds_category</a></pre>
+
+
+</td>
+
+<td>
+<pre><a href = "#DS_Tag3735929089">DS_Tag</a></pre>
+
+
+</td>
+
+<td>
+<p>The underlying data-structure tag of the container. comment = </p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "ms_category3735929740">ms_category</a></pre>
+
+
+</td>
+
+<td>
+<pre><a href = "basic_ms_tag.html"><tt>basic_ms_tag</tt></a></pre>
+
+
+</td>
+
+<td>
+<p>The mapping-semantics category of the container.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link4">Policy definitions.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "30%" ALIGN = "left"><b>Type</b></TD><TD Width = "55%" ALIGN = "left"><b>Definition</b></TD><TD Width = "15%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "allocator3735929520">allocator</a></pre>
+
+
+</td>
+
+<td>
+<pre><a href = "#Allocator3735929488">Allocator</a></pre>
+
+
+</td>
+
+<td>
+<p>Allocator type.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link5">Key-type definitions.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "30%" ALIGN = "left"><b>Type</b></TD><TD Width = "55%" ALIGN = "left"><b>Definition</b></TD><TD Width = "15%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "key_type3735929433">key_type</a></pre>
+
+
+</td>
+
+<td>
+<pre><b>typename</b> <a href = "#allocator3735929520">allocator</a>::<b>template</b> rebind&lt;
+ <a href = "#Key3735928856">Key</a>&gt;::other::value_type</pre>
+
+
+</td>
+
+<td>
+<p>Key type.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "key_reference3735929926">key_reference</a></pre>
+
+
+</td>
+
+<td>
+<pre><b>typename</b> <a href = "#allocator3735929520">allocator</a>::<b>template</b> rebind&lt;
+ <a href = "#Key3735928856">Key</a>&gt;::other::reference</pre>
+
+
+</td>
+
+<td>
+<p>Key reference type.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "const_key_reference3735929552">const_key_reference</a></pre>
+
+
+</td>
+
+<td>
+<pre><b>typename</b> <a href = "#allocator3735929520">allocator</a>::<b>template</b> rebind&lt;
+ <a href = "#Key3735928856">Key</a>&gt;::other::const_reference</pre>
+
+
+</td>
+
+<td>
+<p>Const key reference type.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "key_pointer3735929752">key_pointer</a></pre>
+
+
+</td>
+
+<td>
+<pre><b>typename</b> <a href = "#allocator3735929520">allocator</a>::<b>template</b> rebind&lt;
+ <a href = "#Key3735928856">Key</a>&gt;::other::pointer</pre>
+
+
+</td>
+
+<td>
+<p>Key pointer type.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "const_key_pointer3735929445">const_key_pointer</a></pre>
+
+
+</td>
+
+<td>
+<pre><b>typename</b> <a href = "#allocator3735929520">allocator</a>::<b>template</b> rebind&lt;
+ <a href = "#Key3735928856">Key</a>&gt;::other::const_pointer</pre>
+
+
+</td>
+
+<td>
+<p>Const key pointer type.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link6">Value-type definitions.
+</a>
+
+</h2>
+
+<p><p>Types pertaining to the <b>domain</b> of the relationships of the table.</p> <p>This is explained in <a href = "concepts.html#concepts_types">Data Types, Value Types, Mapped Data Types, and Mapped Value Types</a> and <a href = "non_unique_mapping.html#types">Mapped Data Types and Mapped Value Types</a>.</p></p>
+
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "30%" ALIGN = "left"><b>Type</b></TD><TD Width = "55%" ALIGN = "left"><b>Definition</b></TD><TD Width = "15%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "value_type3735929645">value_type</a></pre>
+
+
+</td>
+
+<td>
+<pre><b>typename</b> <a href = "#allocator3735929520">allocator</a>::rebind&lt;
+ <a href = "#key_type3735929433">key_type</a>&gt;::other::value_type</pre>
+
+
+</td>
+
+<td>
+<p>Data type.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "reference3735929502">reference</a></pre>
+
+
+</td>
+
+<td>
+<pre><b>typename</b> <a href = "#allocator3735929520">allocator</a>::rebind&lt;
+ <a href = "#key_type3735929433">key_type</a>&gt;::other::const_reference</pre>
+
+
+</td>
+
+<td>
+<p>Value reference type.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "const_reference3735930148">const_reference</a></pre>
+
+
+</td>
+
+<td>
+<pre><b>typename</b> <a href = "#allocator3735929520">allocator</a>::rebind&lt;
+ <a href = "#key_type3735929433">key_type</a>&gt;::other::const_reference</pre>
+
+
+</td>
+
+<td>
+<p>Const value reference type.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "pointer3735929328">pointer</a></pre>
+
+
+</td>
+
+<td>
+<pre><b>typename</b> <a href = "#allocator3735929520">allocator</a>::rebind&lt;
+ <a href = "#key_type3735929433">key_type</a>&gt; &gt;::other::const_pointer</pre>
+
+
+</td>
+
+<td>
+<p>Value pointer type.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "const_pointer3735929974">const_pointer</a></pre>
+
+
+</td>
+
+<td>
+<pre><b>typename</b> <a href = "#allocator3735929520">allocator</a>::rebind&lt;
+ <a href = "#key_type3735929433">key_type</a>&gt; &gt;::other::const_pointer</pre>
+
+
+</td>
+
+<td>
+<p>Const Value pointer type.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link7">Iterator definitions.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "30%" ALIGN = "left"><b>Type</b></TD><TD Width = "55%" ALIGN = "left"><b>Definition</b></TD><TD Width = "15%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "const_find_iterator3735929537">const_find_iterator</a></pre>
+
+
+</td>
+
+<td>
+<pre>Underlying data-structure's const find-type iterator.</pre>
+
+
+</td>
+
+<td>
+<p>Const find-type iterator.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "find_iterator3735929945">find_iterator</a></pre>
+
+
+</td>
+
+<td>
+<pre>Underlying data-structure's find-type iterator.</pre>
+
+
+</td>
+
+<td>
+<p>Find-type iterator.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "const_iterator3735930079">const_iterator</a></pre>
+
+
+</td>
+
+<td>
+<pre>Underlying data-structure's const range-type iterator.</pre>
+
+
+</td>
+
+<td>
+<p>Const range-type iterator.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "iterator3735929433">iterator</a></pre>
+
+
+</td>
+
+<td>
+<pre>Underlying data-structure's range-type iterator.</pre>
+
+
+</td>
+
+<td>
+<p>Range-type iterator.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link8">Constructors, destructor, and related.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>virtual</b>
+ ~basic_assoc_cntnr
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Destructor.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link9">Information methods.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>inline</b> <a href = "#size_type3735929547">size_type</a>
+ size
+ () <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Returns the number of distinct <a href = "#value_type3735929645"><tt>value_type</tt></a> objects the container object is storing.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <a href = "#size_type3735929547">size_type</a>
+ max_size
+ () <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Returns an upper bound on the number of distinct <a href = "#value_type3735929645"><tt>value_type</tt></a> objects this container can store.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <b>bool</b>
+ empty
+ () <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Returns whether the container object is not storing any <a href = "#value_type3735929645"><tt>value_type</tt></a> objects.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> static <a href = "#const_key_reference3735929552">const_key_reference</a>
+ extract_key
+ (<a href = "#const_reference3735930148">const_reference</a> r_val)</pre>
+
+
+</td>
+
+<td>
+<p>Extracts a key from a <a href = "#value_type3735929645"><tt>value_type</tt></a>.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link10">Insert methods.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>inline</b> std::pair&lt;<a href = "#find_iterator3735929945">find_iterator</a>, <b>bool</b>&gt;
+ insert
+ (<a href = "#const_reference3735930148">const_reference</a> r_val)</pre>
+
+
+</td>
+
+<td>
+<p>Inserts a <a href = "#value_type3735929645"><tt>value_type</tt></a> object. If no <a href = "#value_type3735929645"><tt>value_type</tt></a> with <font color = "#666666"><tt>r_val</tt></font>'s key was in the container object, inserts and returns (<a href = "#find_iterator3735929945"><tt>find_iterator</tt></a> object associated with <font color = "#666666"><tt>r_val</tt></font>, <tt><b>true</b></tt>); otherwise just returns (<a href = "#find_iterator3735929945"><tt>find_iterator</tt></a> object associated with <font color = "#666666"><tt>r_val</tt></font>'s key, <tt><b>false</b></tt>).</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link11">Find methods.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>inline</b> <a href = "#find_iterator3735929945">find_iterator</a>
+ find
+ (<a href = "#const_key_reference3735929552">const_key_reference</a> r_key)</pre>
+
+
+</td>
+
+<td>
+<p>Returns the <a href = "#find_iterator3735929945"><tt>find_iterator</tt></a> corresponding to the <a href = "#value_type3735929645"><tt>value_type</tt></a> with <font color = "#666666"><tt>r_key</tt></font> as its key, or the <a href = "#find_iterator3735929945"><tt>find_iterator</tt></a> corresponding to the just-after-last entry if no such <a href = "#value_type3735929645"><tt>value_type</tt></a>.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <a href = "#const_find_iterator3735929537">const_find_iterator</a>
+ find
+ (<a href = "#const_key_reference3735929552">const_key_reference</a> r_key) <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Returns the <a href = "#const_find_iterator3735929537"><tt>const_find_iterator</tt></a> corresponding to the <a href = "#value_type3735929645"><tt>value_type</tt></a> with <font color = "#666666"><tt>r_key</tt></font> as its key, or the <a href = "#const_find_iterator3735929537"><tt>const_find_iterator</tt></a> corresponding to the just-after-last entry if no such <a href = "#value_type3735929645"><tt>value_type</tt></a>.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link12">Erase methods.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>inline</b> <a href = "#size_type3735929547">size_type</a>
+ erase
+ (<a href = "#const_key_reference3735929552">const_key_reference</a> r_key)</pre>
+
+
+</td>
+
+<td>
+<p>Erases the <a href = "#value_type3735929645"><tt>value_type</tt></a> associated with <font color = "#666666"><tt>r_key</tt></font>; returns the number of <a href = "#value_type3735929645"><tt>value_type</tt></a>s erased (0 or 1).</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>template</b>&lt;
+ <b>class</b> Pred&gt;
+<b>inline</b> <a href = "#size_type3735929547">size_type</a>
+ erase_if
+ (Pred prd)</pre>
+
+
+</td>
+
+<td>
+<p>Erases any <a href = "#value_type3735929645"><tt>value_type</tt></a> satisfying the predicate <font color = "#666666"><tt>prd</tt></font> (this is transactional, either all matching <a href = "#value_type3735929645"><tt>value_type</tt></a>s are erased, or, if an exception is thrown (for types whose erase can throw an exception) none); returns the number of <a href = "#value_type3735929645"><tt>value_type</tt></a>s erased.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>void</b>
+ clear
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Clears the container object.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link13">Iteration methods.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>inline</b> <a href = "#iterator3735929433">iterator</a>
+ begin
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Returns an <a href = "#iterator3735929433"><tt>iterator</tt></a> corresponding to the first <a href = "#value_type3735929645"><tt>value_type</tt></a> in the container.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <a href = "#const_iterator3735930079">const_iterator</a>
+ begin
+ () <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Returns a <a href = "#const_iterator3735930079"><tt>const_iterator</tt></a> corresponding to the first <a href = "#value_type3735929645"><tt>value_type</tt></a> in the container.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <a href = "#iterator3735929433">iterator</a>
+ end
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Returns an <a href = "#iterator3735929433"><tt>iterator</tt></a> corresponding to the just-after_last <a href = "#value_type3735929645"><tt>value_type</tt></a> in the container.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <a href = "#const_iterator3735930079">const_iterator</a>
+ end
+ () <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Returns a <a href = "#const_iterator3735930079"><tt>const_iterator</tt></a> corresponding to the just-after_last <a href = "#value_type3735929645"><tt>value_type</tt></a> in the container.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+
+
+</body>
+
+</html>
+
+
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/basic_ds_tag.html b/libstdc++-v3/docs/html/ext/pb_assoc/basic_ds_tag.html
new file mode 100644
index 0000000..ca10f35
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/basic_ds_tag.html
@@ -0,0 +1,41 @@
+
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+
+
+<html>
+<head>
+<title>basic_ds_tag Interface
+</title>
+
+</head>
+
+<body>
+<h1>
+<tt>basic_ds_tag
+</tt>
+
+ Interface
+
+
+</h1>
+
+<p>Basic data-structure tag.
+</p>
+
+<ol>
+<li>
+<a href = "../../../../include/ext/pb_assoc/ds_trait.hpp"><tt>ds_trait.hpp</tt>
+</a>
+
+</li>
+
+</ol>
+
+
+
+
+</body>
+
+</html>
+
+
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/basic_hash_assoc_cntnr.html b/libstdc++-v3/docs/html/ext/pb_assoc/basic_hash_assoc_cntnr.html
new file mode 100644
index 0000000..94939ab
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/basic_hash_assoc_cntnr.html
@@ -0,0 +1,609 @@
+
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+
+
+<html>
+<head>
+<title>basic_hash_assoc_cntnr Interface
+</title>
+
+</head>
+
+<body>
+<h1>
+<tt>basic_hash_assoc_cntnr
+</tt>
+
+ Interface
+
+
+</h1>
+
+<p>A basic hash-based associative container.
+</p>
+
+<ol>
+<li>
+<a href = "../../../../include/ext/pb_assoc/assoc_cntnr.hpp"><tt>assoc_cntnr.hpp</tt>
+</a>
+
+</li>
+
+<li>
+<a href = "#link1">Template parameters.
+</a>
+
+</li>
+
+<li>
+<a href = "#link2">Base classes.
+</a>
+
+</li>
+
+<li>
+Public Types and Constants:
+
+
+<ol>
+<li>
+<a href = "#link3">Policy definitions.
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+<li>
+Public Methods:
+
+
+<ol>
+<li>
+<a href = "#link4">Constructors, destructor, and related.
+</a>
+
+</li>
+
+<li>
+<a href = "#link5">Policy access methods.
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+<li>
+Protected Methods:
+
+
+<ol>
+<li>
+<a href = "#link6">Resize methods.
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+</ol>
+
+
+<h2>
+<a name = "link1">Template parameters.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "20%" ALIGN = "left"><b>Parameter</b></TD><TD Width = "50%" ALIGN = "left"><b>Description</b></TD><TD Width = "30%" ALIGN = "left"><b>Default Value</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "Key3735928856">Key</a></pre>
+
+
+</td>
+
+<td>
+<p>Key type.</p>
+
+
+</td>
+
+<td>
+-
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "Data3735928937">Data</a></pre>
+
+
+</td>
+
+<td>
+<p>Data type.</p>
+
+
+</td>
+
+<td>
+-
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "Hash_Fn3735929222">Hash_Fn</a></pre>
+
+
+</td>
+
+<td>
+<p>Hash functor.</p>
+
+
+</td>
+
+<td>
+-
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "Eq_Fn3735929016">Eq_Fn</a></pre>
+
+
+</td>
+
+<td>
+<p>Equivalence functor.</p>
+
+
+</td>
+
+<td>
+-
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "Resize_Policy3735929904">Resize_Policy</a></pre>
+
+
+</td>
+
+<td>
+<p>Resize policy.</p>
+
+
+</td>
+
+<td>
+-
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "Store_Hash3735929567">Store_Hash</a></pre>
+
+
+</td>
+
+<td>
+<p>Indicates whether the hash value will be stored along with each key.</p>
+
+
+</td>
+
+<td>
+-
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "DS_Tag,3735929133">DS_Tag,</a></pre>
+
+
+</td>
+
+<td>
+<p>Data-structure tag.</p>
+
+
+</td>
+
+<td>
+-
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "Allocator3735929488">Allocator</a></pre>
+
+
+</td>
+
+<td>
+<p>Allocator type.</p>
+
+
+</td>
+
+<td>
+-
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link2">Base classes.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "80%" ALIGN = "left"><b>Class</b></TD><TD Width = "20%" ALIGN = "left"><b>Derivation Type</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a href = "#Resize_Policy3735929904">Resize_Policy</a></pre>
+
+
+</td>
+
+<td>
+<p>public</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a href = "#Hash_Fn3735929222">Hash_Fn</a></pre>
+
+
+</td>
+
+<td>
+<p>public</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre>Depending on <a href = "#Data3735928937">Data</a>:<ol> <li> <a href = "null_data_type.html"><tt>null_data_type</tt></a> - <a href = "basic_assoc_cntnr_no_data.html"><tt>basic_assoc_cntnr</tt></a> &quot;set&quot; specialization </li> <li> <a href = "compound_data_type.html"><tt>compound_data_type</tt></a><tt>&lt;Container&gt;</tt> - <a href = "basic_assoc_cntnr_compound_data.html"><tt>basic_assoc_cntnr</tt></a> &quot;multimap&quot; specialization </li> <li> Other - <a href = "basic_assoc_cntnr.html"><tt>basic_assoc_cntnr</tt></a> &quot;map&quot; specialization </li></ol></pre>
+
+
+</td>
+
+<td>
+<p>public</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link3">Policy definitions.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "30%" ALIGN = "left"><b>Type</b></TD><TD Width = "55%" ALIGN = "left"><b>Definition</b></TD><TD Width = "15%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "hash_fn3735929286">hash_fn</a></pre>
+
+
+</td>
+
+<td>
+<pre><a href = "#Hash_Fn3735929222">Hash_Fn</a></pre>
+
+
+</td>
+
+<td>
+<p>Hash functor type.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "eq_fn3735929080">eq_fn</a></pre>
+
+
+</td>
+
+<td>
+<pre><a href = "#Eq_Fn3735929016">Eq_Fn</a></pre>
+
+
+</td>
+
+<td>
+<p>Equivalence functor type.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "resize_policy3735929968">resize_policy</a></pre>
+
+
+</td>
+
+<td>
+<pre><a href = "#Resize_Policy3735929904">Resize_Policy</a></pre>
+
+
+</td>
+
+<td>
+<p>Resize policy type.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "store_hash3735929631">store_hash</a></pre>
+
+
+</td>
+
+<td>
+<pre><a href = "#Store_Hash3735929567">Store_Hash</a></pre>
+
+
+</td>
+
+<td>
+<p>Indicates whether a hash value is stored with each entry.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link4">Constructors, destructor, and related.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>virtual</b>
+ ~basic_hash_assoc_cntnr
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Destructor.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link5">Policy access methods.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a href = "#hash_fn3735929286">hash_fn</a> &amp;
+ get_hash_fn
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Access to the <a href = "#hash_fn3735929286"><tt>hash_fn</tt></a> object.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>const</b> <a href = "#hash_fn3735929286">hash_fn</a> &amp;
+ get_hash_fn
+ () <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Const access to the <a href = "#hash_fn3735929286"><tt>hash_fn</tt></a> object.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a href = "#eq_fn3735929080">eq_fn</a> &amp;
+ get_eq_fn
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Access to the <a href = "#eq_fn3735929080"><tt>eq_fn</tt></a> object.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>const</b> <a href = "#eq_fn3735929080">eq_fn</a> &amp;
+ get_eq_fn
+ () <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Const access to the <a href = "#eq_fn3735929080"><tt>eq_fn</tt></a> object.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a href = "#Resize_Policy3735929904">Resize_Policy</a> &amp;
+ get_resize_policy
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Access to the <a href = "#resize_policy3735929968"><tt>resize_policy</tt></a> object.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>const</b> <a href = "#resize_policy3735929968">resize_policy</a> &amp;
+ get_resize_policy
+ () <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Const access to the <a href = "#resize_policy3735929968"><tt>resize_policy</tt></a> object.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link6">Resize methods.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>virtual</b> <b>void</b>
+ do_resize
+ (size_type new_size)</pre>
+
+
+</td>
+
+<td>
+<p>Resizes the container object to <font color = "#666666"><tt>new_size</tt></font>.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+
+
+</body>
+
+</html>
+
+
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/basic_hash_ds_tag.html b/libstdc++-v3/docs/html/ext/pb_assoc/basic_hash_ds_tag.html
new file mode 100644
index 0000000..af421d8
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/basic_hash_ds_tag.html
@@ -0,0 +1,74 @@
+
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+
+
+<html>
+<head>
+<title>basic_hash_ds_tag Interface
+</title>
+
+</head>
+
+<body>
+<h1>
+<tt>basic_hash_ds_tag
+</tt>
+
+ Interface
+
+
+</h1>
+
+<p>Basic hash data-structure tag.
+</p>
+
+<ol>
+<li>
+<a href = "../../../../include/ext/pb_assoc/ds_trait.hpp"><tt>ds_trait.hpp</tt>
+</a>
+
+</li>
+
+<li>
+<a href = "#link1">Base classes.
+</a>
+
+</li>
+
+</ol>
+
+
+<h2>
+<a name = "link1">Base classes.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "80%" ALIGN = "left"><b>Class</b></TD><TD Width = "20%" ALIGN = "left"><b>Derivation Type</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a href = "basic_ds_tag.html"><tt>basic_ds_tag</tt></a></pre>
+
+
+</td>
+
+<td>
+<p>public</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+
+
+</body>
+
+</html>
+
+
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/basic_invalidation_guarantee.html b/libstdc++-v3/docs/html/ext/pb_assoc/basic_invalidation_guarantee.html
new file mode 100644
index 0000000..8bba96c
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/basic_invalidation_guarantee.html
@@ -0,0 +1,41 @@
+
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+
+
+<html>
+<head>
+<title>basic_invalidation_guarantee Interface
+</title>
+
+</head>
+
+<body>
+<h1>
+<tt>basic_invalidation_guarantee
+</tt>
+
+ Interface
+
+
+</h1>
+
+<p>Signifies a basic invalidation guarantee that any iterator, pointer, or reference to a container object's mapped value type is valid as long as the container is not modified.
+</p>
+
+<ol>
+<li>
+<a href = "../../../../include/ext/pb_assoc/ds_trait.hpp"><tt>ds_trait.hpp</tt>
+</a>
+
+</li>
+
+</ol>
+
+
+
+
+</body>
+
+</html>
+
+
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/basic_ms_tag.html b/libstdc++-v3/docs/html/ext/pb_assoc/basic_ms_tag.html
new file mode 100644
index 0000000..a4e7dd0
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/basic_ms_tag.html
@@ -0,0 +1,41 @@
+
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+
+
+<html>
+<head>
+<title>basic_ms_tag Interface
+</title>
+
+</head>
+
+<body>
+<h1>
+<tt>basic_ms_tag
+</tt>
+
+ Interface
+
+
+</h1>
+
+<p>Basic mapping-semantics tag.
+</p>
+
+<ol>
+<li>
+<a href = "../../../../include/ext/pb_assoc/ms_trait.hpp"><tt>ms_trait.hpp</tt>
+</a>
+
+</li>
+
+</ol>
+
+
+
+
+</body>
+
+</html>
+
+
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/basic_tree_assoc_cntnr.html b/libstdc++-v3/docs/html/ext/pb_assoc/basic_tree_assoc_cntnr.html
new file mode 100644
index 0000000..73595b7
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/basic_tree_assoc_cntnr.html
@@ -0,0 +1,940 @@
+
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+
+
+<html>
+<head>
+<title>basic_tree_assoc_cntnr Interface
+</title>
+
+</head>
+
+<body>
+<h1>
+<tt>basic_tree_assoc_cntnr
+</tt>
+
+ Interface
+
+
+</h1>
+
+<p>A basic tree-based associative container.
+</p>
+
+<ol>
+<li>
+<a href = "../../../../include/ext/pb_assoc/assoc_cntnr.hpp"><tt>assoc_cntnr.hpp</tt>
+</a>
+
+</li>
+
+<li>
+<a href = "#link1">Template parameters.
+</a>
+
+</li>
+
+<li>
+<a href = "#link2">Base classes.
+</a>
+
+</li>
+
+<li>
+Public Types and Constants:
+
+
+<ol>
+<li>
+<a href = "#link3">General container definitions.
+</a>
+
+</li>
+
+<li>
+<a href = "#link4">Key-type definitions.
+</a>
+
+</li>
+
+<li>
+<a href = "#link5">Policy definitions.
+</a>
+
+</li>
+
+<li>
+<a href = "#link6">Iterator definitions.
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+<li>
+Public Methods:
+
+
+<ol>
+<li>
+<a href = "#link7">Constructors, destructor, and related.
+</a>
+
+</li>
+
+<li>
+<a href = "#link8">Policy access methods.
+</a>
+
+</li>
+
+<li>
+<a href = "#link9">Erase methods.
+</a>
+
+</li>
+
+<li>
+<a href = "#link10">Iteration methods.
+</a>
+
+</li>
+
+<li>
+<a href = "#link11">Node-Iteration methods.
+</a>
+
+</li>
+
+<li>
+<a href = "#link12">Split and join methods.
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+</ol>
+
+
+<h2>
+<a name = "link1">Template parameters.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "20%" ALIGN = "left"><b>Parameter</b></TD><TD Width = "50%" ALIGN = "left"><b>Description</b></TD><TD Width = "30%" ALIGN = "left"><b>Default Value</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "Key3735928856">Key</a></pre>
+
+
+</td>
+
+<td>
+<p>Key type.</p>
+
+
+</td>
+
+<td>
+-
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "Data3735928937">Data</a></pre>
+
+
+</td>
+
+<td>
+<p>Data type.</p>
+
+
+</td>
+
+<td>
+-
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "Cmp_Fn3735929122">Cmp_Fn</a></pre>
+
+
+</td>
+
+<td>
+<p>Comparison functor.</p>
+
+
+</td>
+
+<td>
+-
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "DS_Tag,3735929133">DS_Tag,</a></pre>
+
+
+</td>
+
+<td>
+<p>Data-structure tag.</p>
+
+
+</td>
+
+<td>
+-
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "Node_Updator3735929779">Node_Updator</a></pre>
+
+
+</td>
+
+<td>
+<p>Node updator type.</p>
+
+
+<p><a href = "concepts.html#concepts_node_invariants">Node Invariants</a> explains this concept.</p>
+
+
+</td>
+
+<td>
+-
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "Allocator3735929488">Allocator</a></pre>
+
+
+</td>
+
+<td>
+<p>Allocator type.</p>
+
+
+</td>
+
+<td>
+-
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link2">Base classes.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "80%" ALIGN = "left"><b>Class</b></TD><TD Width = "20%" ALIGN = "left"><b>Derivation Type</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a href = "#Node_Updator3735929779">Node_Updator</a></pre>
+
+
+</td>
+
+<td>
+<p>public</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link3">General container definitions.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "30%" ALIGN = "left"><b>Type</b></TD><TD Width = "55%" ALIGN = "left"><b>Definition</b></TD><TD Width = "15%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "size_type3735929547">size_type</a></pre>
+
+
+</td>
+
+<td>
+<pre><b>typename</b> <a href = "#Allocator3735929488">Allocator</a>::size_type</pre>
+
+
+</td>
+
+<td>
+<p>Size type.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link4">Key-type definitions.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "30%" ALIGN = "left"><b>Type</b></TD><TD Width = "55%" ALIGN = "left"><b>Definition</b></TD><TD Width = "15%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "const_key_reference3735929552">const_key_reference</a></pre>
+
+
+</td>
+
+<td>
+<pre><b>typename</b> <a href = "#Allocator3735929488">Allocator</a>::<b>template</b> rebind&lt;
+ <a href = "#Key3735928856">Key</a>&gt;::other::const_reference</pre>
+
+
+</td>
+
+<td>
+<p>Const key reference type.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link5">Policy definitions.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "30%" ALIGN = "left"><b>Type</b></TD><TD Width = "55%" ALIGN = "left"><b>Definition</b></TD><TD Width = "15%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "cmp_fn3735929186">cmp_fn</a></pre>
+
+
+</td>
+
+<td>
+<pre><a href = "#Cmp_Fn3735929122">Cmp_Fn</a></pre>
+
+
+</td>
+
+<td>
+<p>Comparison functor type.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "node_updator3735929843">node_updator</a></pre>
+
+
+</td>
+
+<td>
+<pre><a href = "#Node_Updator3735929779">Node_Updator</a></pre>
+
+
+</td>
+
+<td>
+<p>Node updator type.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link6">Iterator definitions.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "30%" ALIGN = "left"><b>Type</b></TD><TD Width = "55%" ALIGN = "left"><b>Definition</b></TD><TD Width = "15%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "const_iterator3735930079">const_iterator</a></pre>
+
+
+</td>
+
+<td>
+<pre>Underlying data-structure's const range-type iterator.</pre>
+
+
+</td>
+
+<td>
+<p>Const range-type iterator.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "iterator3735929433">iterator</a></pre>
+
+
+</td>
+
+<td>
+<pre>Underlying data-structure's range-type iterator.</pre>
+
+
+</td>
+
+<td>
+<p>Range-type iterator.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "const_reverse_iterator3735929745">const_reverse_iterator</a></pre>
+
+
+</td>
+
+<td>
+<pre>Underlying data-structure's const reverse range-type iterator.</pre>
+
+
+</td>
+
+<td>
+<p>Const reverse range-type iterator.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "reverse_iterator3735929420">reverse_iterator</a></pre>
+
+
+</td>
+
+<td>
+<pre>Underlying data-structure's reverse range-type iterator.</pre>
+
+
+</td>
+
+<td>
+<p>Reverse range-type iterator.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "const_node_iterator3735929535">const_node_iterator</a></pre>
+
+
+</td>
+
+<td>
+<pre><a href = "basic_tree_assoc_cntnr_const_node_iterator.html"><tt><font color = "olive">basic_tree_assoc_cntnr</font>::const_node_iterator</tt></a></pre>
+
+
+</td>
+
+<td>
+<p>Const node iterator.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "node_iterator3735929950">node_iterator</a></pre>
+
+
+</td>
+
+<td>
+<pre><a href = "basic_tree_assoc_cntnr_node_iterator.html"><tt><font color = "olive">basic_tree_assoc_cntnr</font>::node_iterator</tt></a></pre>
+
+
+</td>
+
+<td>
+<p>Node iterator.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link7">Constructors, destructor, and related.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>virtual</b>
+ ~basic_tree_assoc_cntnr
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Destructor.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link8">Policy access methods.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a href = "#cmp_fn3735929186">cmp_fn</a> &amp;
+ get_cmp_fn
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Access to the <a href = "#cmp_fn3735929186"><tt>cmp_fn</tt></a> object.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>const</b> <a href = "#cmp_fn3735929186">cmp_fn</a> &amp;
+ get_cmp_fn
+ () <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Const access to the <a href = "#cmp_fn3735929186"><tt>cmp_fn</tt></a> object.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a href = "#node_updator3735929843">node_updator</a> &amp;
+ get_node_updator
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Access to the <a href = "#node_updator3735929843"><tt>node_updator</tt></a> object.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>const</b> <a href = "#node_updator3735929843">node_updator</a> &amp;
+ get_node_updator
+ () <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Const access to the <a href = "#node_updator3735929843"><tt>node_updator</tt></a> object.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link9">Erase methods.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>inline</b> <a href = "#size_type3735929547">size_type</a>
+ erase
+ (<a href = "#const_key_reference3735929552">const_key_reference</a> r_key)</pre>
+
+
+</td>
+
+<td>
+<p>Erases the value_type associated with <font color = "#666666"><tt>r_key</tt></font>; returns the number of value_types erased (0 or 1).</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <a href = "#iterator3735929433">iterator</a>
+ erase
+ (<a href = "#iterator3735929433">iterator</a> it)</pre>
+
+
+</td>
+
+<td>
+<p>Erases the value_type corresponding to the <a href = "#iterator3735929433"><tt>iterator</tt></a> <font color = "#666666"><tt>it</tt></font>. Returns the <a href = "#iterator3735929433"><tt>iterator</tt></a> corresponding to the next value_type.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <a href = "#reverse_iterator3735929420">reverse_iterator</a>
+ erase
+ (<a href = "#reverse_iterator3735929420">reverse_iterator</a> it)</pre>
+
+
+</td>
+
+<td>
+<p>Erases the value_type corresponding to the <a href = "#reverse_iterator3735929420"><tt>reverse_iterator</tt></a> <font color = "#666666"><tt>it</tt></font>. Returns the <a href = "#reverse_iterator3735929420"><tt>reverse_iterator</tt></a> corresponding to the previous value_type.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link10">Iteration methods.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>inline</b> <a href = "#reverse_iterator3735929420">reverse_iterator</a>
+ rbegin
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Returns a <a href = "#reverse_iterator3735929420"><tt>reverse_iterator</tt></a> corresponding to the last value_type in the container.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <a href = "#const_reverse_iterator3735929745">const_reverse_iterator</a>
+ rbegin
+ () <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Returns a <a href = "#const_reverse_iterator3735929745"><tt>const_reverse_iterator</tt></a> corresponding to the last value_type in the container.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <a href = "#reverse_iterator3735929420">reverse_iterator</a>
+ rend
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Returns a <a href = "#reverse_iterator3735929420"><tt>reverse_iterator</tt></a> corresponding to the just-before-first value_type in the container.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <a href = "#const_reverse_iterator3735929745">const_reverse_iterator</a>
+ rend
+ () <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Returns a <a href = "#const_reverse_iterator3735929745"><tt>const_reverse_iterator</tt></a> corresponding to the just-before-first value_type in the container.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link11">Node-Iteration methods.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>inline</b> <a href = "#node_iterator3735929950">node_iterator</a>
+ node_begin
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Returns a <a href = "#node_iterator3735929950"><tt>node_iterator</tt></a> corresponding to the value_type at the root of the tree.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <a href = "#const_node_iterator3735929535">const_node_iterator</a>
+ node_begin
+ () <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Returns a <a href = "#const_node_iterator3735929535"><tt>const_node_iterator</tt></a> corresponding to the value_type at the root of the tree.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <a href = "#node_iterator3735929950">node_iterator</a>
+ node_end
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Returns a <a href = "#node_iterator3735929950"><tt>node_iterator</tt></a> corresponding to a value_type just after a leaf of the tree.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <a href = "#const_node_iterator3735929535">const_node_iterator</a>
+ node_end
+ () <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Returns a <a href = "#const_node_iterator3735929535"><tt>const_node_iterator</tt></a> corresponding to a value_type just after a leaf of the tree.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link12">Split and join methods.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>void</b>
+ join
+ (<font color = "olive">basic_tree_assoc_cntnr</font> &amp;r_other)</pre>
+
+
+</td>
+
+<td>
+<p>Joins two trees. When this function returns, <font color = "#666666"><tt>r_other</tt></font> will be empty.</p>
+
+
+<p>When calling this function, <font color = "#666666"><tt>r_other</tt></font>'s keys must be all larger or all smaller than this object's keys. </p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <b>void</b>
+ split
+ (<a href = "#const_key_reference3735929552">const_key_reference</a> r_key,
+ <font color = "olive">basic_tree_assoc_cntnr</font> &amp;r_other)</pre>
+
+
+</td>
+
+<td>
+<p>Joins two trees. When this function returns, <font color = "#666666"><tt>r_other</tt></font> will be empty.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+
+
+</body>
+
+</html>
+
+
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/basic_tree_assoc_cntnr_const_node_iterator.html b/libstdc++-v3/docs/html/ext/pb_assoc/basic_tree_assoc_cntnr_const_node_iterator.html
new file mode 100644
index 0000000..2262fe4
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/basic_tree_assoc_cntnr_const_node_iterator.html
@@ -0,0 +1,488 @@
+
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+
+
+<html>
+<head>
+<title>basic_tree_assoc_cntnr::const_node_iterator Interface
+</title>
+
+</head>
+
+<body>
+<h1>
+<tt><font color = "olive">basic_tree_assoc_cntnr</font>::const_node_iterator
+</tt>
+
+ Interface
+
+
+</h1>
+
+<p>Const node iterator.
+</p>
+
+<p>This is an
+</p>
+
+<ol>
+<li>
+Public Types and Constants:
+
+
+<ol>
+<li>
+<a href = "#link1">Iterator definitions.
+</a>
+
+</li>
+
+<li>
+<a href = "#link2">Value-type definitions.
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+<li>
+Public Methods:
+
+
+<ol>
+<li>
+<a href = "#link3">Constructors, destructor, and related.
+</a>
+
+</li>
+
+<li>
+<a href = "#link4">Access methods.
+</a>
+
+</li>
+
+<li>
+<a href = "#link5">Movement methods.
+</a>
+
+</li>
+
+<li>
+<a href = "#link6">Comparison methods.
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+</ol>
+
+
+<h2>
+<a name = "link1">Iterator definitions.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "30%" ALIGN = "left"><b>Type</b></TD><TD Width = "55%" ALIGN = "left"><b>Definition</b></TD><TD Width = "15%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "iterator_category3735929377">iterator_category</a></pre>
+
+
+</td>
+
+<td>
+<pre>trivial_iterator_tag</pre>
+
+
+</td>
+
+<td>
+<p>Category. comment = </p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "difference_type3735930139">difference_type</a></pre>
+
+
+</td>
+
+<td>
+<pre><b>void</b></pre>
+
+
+</td>
+
+<td>
+<p>Difference type.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link2">Value-type definitions.
+</a>
+
+</h2>
+
+<p>Note that a node iterator's value type is actually a tree iterator.</p>
+
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "30%" ALIGN = "left"><b>Type</b></TD><TD Width = "55%" ALIGN = "left"><b>Definition</b></TD><TD Width = "15%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "value_type3735929645">value_type</a></pre>
+
+
+</td>
+
+<td>
+<pre><a href = "../../pb_assoc/doc/basic_tree_assoc_cntnr.html#const_iterator3735930079">const_iterator</a></pre>
+
+
+</td>
+
+<td>
+<p>Iterator's value type.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "pointer3735929328">pointer</a></pre>
+
+
+</td>
+
+<td>
+<pre><a href = "../../pb_assoc/doc/basic_tree_assoc_cntnr.html#const_iterator3735930079">const_iterator</a> *</pre>
+
+
+</td>
+
+<td>
+<p>Iterator's pointer type.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "const_pointer3735929974">const_pointer</a></pre>
+
+
+</td>
+
+<td>
+<pre><a href = "../../pb_assoc/doc/basic_tree_assoc_cntnr.html#const_iterator3735930079">const_iterator</a> *</pre>
+
+
+</td>
+
+<td>
+<p>Iterator's const pointer type.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "reference3735929502">reference</a></pre>
+
+
+</td>
+
+<td>
+<pre><a href = "../../pb_assoc/doc/basic_tree_assoc_cntnr.html#const_iterator3735930079">const_iterator</a> &amp;</pre>
+
+
+</td>
+
+<td>
+<p>Iterator's reference type.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "const_reference3735930148">const_reference</a></pre>
+
+
+</td>
+
+<td>
+<pre><b>const</b> <a href = "../../pb_assoc/doc/basic_tree_assoc_cntnr.html#iterator3735929433">iterator</a> &amp;</pre>
+
+
+</td>
+
+<td>
+<p>Iterator's const reference type.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link3">Constructors, destructor, and related.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "40%" ALIGN = "left"><b>Description</b></TD><TD Width = "10%" ALIGN = "left"><b>Complexity Guarantee</b></TD><TD Width = "5%" ALIGN = "left"><b>Exception Guarantee</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>inline</b>
+ const_node_iterator
+ (<b>const</b> node_pointer p_nd = NULL)</pre>
+
+
+</td>
+
+<td>
+<p>Default constructor.</p>
+
+
+</td>
+
+<td>
+<p> <i>O(1)</i> worst.</p>
+
+
+</td>
+
+<td>
+<a href = "exception_guarantees_specifics.html#cannot_throw_guarantee">3</a>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link4">Access methods.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "40%" ALIGN = "left"><b>Description</b></TD><TD Width = "10%" ALIGN = "left"><b>Complexity Guarantee</b></TD><TD Width = "5%" ALIGN = "left"><b>Exception Guarantee</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>inline</b> <a href = "../../pb_assoc/doc/basic_tree_assoc_cntnr.html#const_iterator3735930079">const_iterator</a>
+ <b>operator</b>*
+ () <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Access.</p>
+
+
+</td>
+
+<td>
+<p> <i>O(1)</i> worst.</p>
+
+
+</td>
+
+<td>
+<a href = "exception_guarantees_specifics.html#cannot_throw_guarantee">3</a>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link5">Movement methods.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "40%" ALIGN = "left"><b>Description</b></TD><TD Width = "10%" ALIGN = "left"><b>Complexity Guarantee</b></TD><TD Width = "5%" ALIGN = "left"><b>Exception Guarantee</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>inline</b> const_node_iterator
+ l_child
+ () <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Returns the <tt><b>const</b></tt> node <a href = "../../pb_assoc/doc/basic_tree_assoc_cntnr.html#iterator3735929433">iterator</a> associated with the left node.</p>
+
+
+</td>
+
+<td>
+<p> <i>O(1)</i> worst.</p>
+
+
+</td>
+
+<td>
+<a href = "exception_guarantees_specifics.html#cannot_throw_guarantee">3</a>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> const_node_iterator
+ r_child
+ () <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Returns the <tt><b>const</b></tt> node <a href = "../../pb_assoc/doc/basic_tree_assoc_cntnr.html#iterator3735929433">iterator</a> associated with the right node.</p>
+
+
+</td>
+
+<td>
+<p> <i>O(1)</i> worst.</p>
+
+
+</td>
+
+<td>
+<a href = "exception_guarantees_specifics.html#cannot_throw_guarantee">3</a>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link6">Comparison methods.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "40%" ALIGN = "left"><b>Description</b></TD><TD Width = "10%" ALIGN = "left"><b>Complexity Guarantee</b></TD><TD Width = "5%" ALIGN = "left"><b>Exception Guarantee</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>inline</b> <b>bool</b>
+ <b>operator</b>==
+ (<b>const</b> const_node_iterator &amp;r_other) <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Compares content to a different <a href = "../../pb_assoc/doc/basic_tree_assoc_cntnr.html#iterator3735929433">iterator</a> object.</p>
+
+
+</td>
+
+<td>
+<p> <i>O(1)</i> worst.</p>
+
+
+</td>
+
+<td>
+<a href = "exception_guarantees_specifics.html#cannot_throw_guarantee">3</a>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <b>bool</b>
+ <b>operator</b>!=
+ (<b>const</b> const_node_iterator &amp;r_other) <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Compares content (negatively) to a different <a href = "../../pb_assoc/doc/basic_tree_assoc_cntnr.html#iterator3735929433">iterator</a> object.</p>
+
+
+</td>
+
+<td>
+<p> <i>O(1)</i> worst.</p>
+
+
+</td>
+
+<td>
+<a href = "exception_guarantees_specifics.html#cannot_throw_guarantee">3</a>
+
+
+</td>
+
+</tr>
+
+</table>
+
+
+
+</body>
+
+</html>
+
+
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/basic_tree_assoc_cntnr_node_iterator.html b/libstdc++-v3/docs/html/ext/pb_assoc/basic_tree_assoc_cntnr_node_iterator.html
new file mode 100644
index 0000000..e17e3eb
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/basic_tree_assoc_cntnr_node_iterator.html
@@ -0,0 +1,250 @@
+
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+
+
+<html>
+<head>
+<title>basic_tree_assoc_cntnr::node_iterator Interface
+</title>
+
+</head>
+
+<body>
+<h1>
+<tt><font color = "olive">basic_tree_assoc_cntnr</font>::node_iterator
+</tt>
+
+ Interface
+
+
+</h1>
+
+<p>Node iterator.
+</p>
+
+<p>This is an
+</p>
+
+<ol>
+<li>
+<a href = "#link1">Base classes.
+</a>
+
+</li>
+
+<li>
+Public Methods:
+
+
+<ol>
+<li>
+<a href = "#link2">Constructors, destructor, and related.
+</a>
+
+</li>
+
+<li>
+<a href = "#link3">Access methods.
+</a>
+
+</li>
+
+<li>
+<a href = "#link4">Movement methods.
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+</ol>
+
+
+<h2>
+<a name = "link1">Base classes.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "80%" ALIGN = "left"><b>Class</b></TD><TD Width = "20%" ALIGN = "left"><b>Derivation Type</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a href = "../../pb_assoc/doc/basic_tree_assoc_cntnr.html#const_node_iterator3735929535">const_node_iterator</a></pre>
+
+
+</td>
+
+<td>
+<p>public</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link2">Constructors, destructor, and related.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "40%" ALIGN = "left"><b>Description</b></TD><TD Width = "10%" ALIGN = "left"><b>Complexity Guarantee</b></TD><TD Width = "5%" ALIGN = "left"><b>Exception Guarantee</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>inline</b>
+ node_iterator
+ (<b>const</b> node_pointer p_nd = NULL)</pre>
+
+
+</td>
+
+<td>
+<p>Default constructor.</p>
+
+
+</td>
+
+<td>
+<p> <i>O(1)</i> worst.</p>
+
+
+</td>
+
+<td>
+<a href = "exception_guarantees_specifics.html#cannot_throw_guarantee">3</a>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link3">Access methods.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "40%" ALIGN = "left"><b>Description</b></TD><TD Width = "10%" ALIGN = "left"><b>Complexity Guarantee</b></TD><TD Width = "5%" ALIGN = "left"><b>Exception Guarantee</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>inline</b> <a href = "../../pb_assoc/doc/basic_tree_assoc_cntnr.html#iterator3735929433">iterator</a>
+ <b>operator</b>*
+ () <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Access.</p>
+
+
+</td>
+
+<td>
+<p> <i>O(1)</i> worst.</p>
+
+
+</td>
+
+<td>
+<a href = "exception_guarantees_specifics.html#cannot_throw_guarantee">3</a>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link4">Movement methods.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "40%" ALIGN = "left"><b>Description</b></TD><TD Width = "10%" ALIGN = "left"><b>Complexity Guarantee</b></TD><TD Width = "5%" ALIGN = "left"><b>Exception Guarantee</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>inline</b> node_iterator
+ l_child
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Returns the node <a href = "../../pb_assoc/doc/basic_tree_assoc_cntnr.html#iterator3735929433">iterator</a> associated with the left node.</p>
+
+
+</td>
+
+<td>
+<p> <i>O(1)</i> worst.</p>
+
+
+</td>
+
+<td>
+<a href = "exception_guarantees_specifics.html#cannot_throw_guarantee">3</a>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> node_iterator
+ r_child
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Returns the node <a href = "../../pb_assoc/doc/basic_tree_assoc_cntnr.html#iterator3735929433">iterator</a> associated with the right node.</p>
+
+
+</td>
+
+<td>
+<p> <i>O(1)</i> worst.</p>
+
+
+</td>
+
+<td>
+<a href = "exception_guarantees_specifics.html#cannot_throw_guarantee">3</a>
+
+
+</td>
+
+</tr>
+
+</table>
+
+
+
+</body>
+
+</html>
+
+
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/basic_tree_assoc_cntnr_rev.html b/libstdc++-v3/docs/html/ext/pb_assoc/basic_tree_assoc_cntnr_rev.html
new file mode 100644
index 0000000..b9596f3
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/basic_tree_assoc_cntnr_rev.html
@@ -0,0 +1,771 @@
+
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+
+
+<html>
+<head>
+<title>basic_tree_assoc_cntnr Interface
+</title>
+
+</head>
+
+<body>
+<h1>
+<tt>basic_tree_assoc_cntnr
+</tt>
+
+ Interface
+
+
+</h1>
+
+<p>A basic tree-based associative container specialized for underlying data-structure which do not support reverse iteration.
+</p>
+
+<ol>
+<li>
+<a href = "../../../../include/ext/pb_assoc/assoc_cntnr.hpp"><tt>assoc_cntnr.hpp</tt>
+</a>
+
+</li>
+
+<li>
+<a href = "#link1">Template parameters.
+</a>
+
+</li>
+
+<li>
+<a href = "#link2">Base classes.
+</a>
+
+</li>
+
+<li>
+Public Types and Constants:
+
+
+<ol>
+<li>
+<a href = "#link3">General container definitions.
+</a>
+
+</li>
+
+<li>
+<a href = "#link4">Key-type definitions.
+</a>
+
+</li>
+
+<li>
+<a href = "#link5">Policy definitions.
+</a>
+
+</li>
+
+<li>
+<a href = "#link6">Iterator definitions.
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+<li>
+Public Methods:
+
+
+<ol>
+<li>
+<a href = "#link7">Constructors, destructor, and related.
+</a>
+
+</li>
+
+<li>
+<a href = "#link8">Policy access methods.
+</a>
+
+</li>
+
+<li>
+<a href = "#link9">Erase methods.
+</a>
+
+</li>
+
+<li>
+<a href = "#link10">Node-Iteration methods.
+</a>
+
+</li>
+
+<li>
+<a href = "#link11">Split and join methods.
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+</ol>
+
+
+<h2>
+<a name = "link1">Template parameters.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "20%" ALIGN = "left"><b>Parameter</b></TD><TD Width = "50%" ALIGN = "left"><b>Description</b></TD><TD Width = "30%" ALIGN = "left"><b>Default Value</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "Key3735928856">Key</a></pre>
+
+
+</td>
+
+<td>
+<p>Key type.</p>
+
+
+</td>
+
+<td>
+-
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "Data3735928937">Data</a></pre>
+
+
+</td>
+
+<td>
+<p>Data type.</p>
+
+
+</td>
+
+<td>
+-
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "Cmp_Fn3735929122">Cmp_Fn</a></pre>
+
+
+</td>
+
+<td>
+<p>Comparison functor.</p>
+
+
+</td>
+
+<td>
+-
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "Node_Updator3735929779">Node_Updator</a></pre>
+
+
+</td>
+
+<td>
+<p>Node updator type.</p>
+
+
+<p><a href = "concepts.html#concepts_node_invariants">Node Invariants</a> explains this concept.</p>
+
+
+</td>
+
+<td>
+-
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "Allocator3735929488">Allocator</a></pre>
+
+
+</td>
+
+<td>
+<p>Allocator type.</p>
+
+
+</td>
+
+<td>
+-
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link2">Base classes.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "80%" ALIGN = "left"><b>Class</b></TD><TD Width = "20%" ALIGN = "left"><b>Derivation Type</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a href = "#Node_Updator3735929779">Node_Updator</a></pre>
+
+
+</td>
+
+<td>
+<p>public</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link3">General container definitions.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "30%" ALIGN = "left"><b>Type</b></TD><TD Width = "55%" ALIGN = "left"><b>Definition</b></TD><TD Width = "15%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "size_type3735929547">size_type</a></pre>
+
+
+</td>
+
+<td>
+<pre><b>typename</b> <a href = "#Allocator3735929488">Allocator</a>::size_type</pre>
+
+
+</td>
+
+<td>
+<p>Size type.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link4">Key-type definitions.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "30%" ALIGN = "left"><b>Type</b></TD><TD Width = "55%" ALIGN = "left"><b>Definition</b></TD><TD Width = "15%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "const_key_reference3735929552">const_key_reference</a></pre>
+
+
+</td>
+
+<td>
+<pre><b>typename</b> <a href = "#Allocator3735929488">Allocator</a>::<b>template</b> rebind&lt;
+ <a href = "#Key3735928856">Key</a>&gt;::other::const_reference</pre>
+
+
+</td>
+
+<td>
+<p>Const key reference type.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link5">Policy definitions.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "30%" ALIGN = "left"><b>Type</b></TD><TD Width = "55%" ALIGN = "left"><b>Definition</b></TD><TD Width = "15%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "cmp_fn3735929186">cmp_fn</a></pre>
+
+
+</td>
+
+<td>
+<pre><a href = "#Cmp_Fn3735929122">Cmp_Fn</a></pre>
+
+
+</td>
+
+<td>
+<p>Comparison functor type.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "node_updator3735929843">node_updator</a></pre>
+
+
+</td>
+
+<td>
+<pre><a href = "#Node_Updator3735929779">Node_Updator</a></pre>
+
+
+</td>
+
+<td>
+<p>Node updator type.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link6">Iterator definitions.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "30%" ALIGN = "left"><b>Type</b></TD><TD Width = "55%" ALIGN = "left"><b>Definition</b></TD><TD Width = "15%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "const_iterator3735930079">const_iterator</a></pre>
+
+
+</td>
+
+<td>
+<pre>Underlying data-structure's const range-type iterator.</pre>
+
+
+</td>
+
+<td>
+<p>Const range-type iterator.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "iterator3735929433">iterator</a></pre>
+
+
+</td>
+
+<td>
+<pre>Underlying data-structure's range-type iterator.</pre>
+
+
+</td>
+
+<td>
+<p>Range-type iterator.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "const_node_iterator3735929535">const_node_iterator</a></pre>
+
+
+</td>
+
+<td>
+<pre><a href = "basic_tree_assoc_cntnr_const_node_iterator.html"><tt><font color = "olive">basic_tree_assoc_cntnr</font>::const_node_iterator</tt></a></pre>
+
+
+</td>
+
+<td>
+<p>Const node iterator.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "node_iterator3735929950">node_iterator</a></pre>
+
+
+</td>
+
+<td>
+<pre><a href = "basic_tree_assoc_cntnr_node_iterator.html"><tt><font color = "olive">basic_tree_assoc_cntnr</font>::node_iterator</tt></a></pre>
+
+
+</td>
+
+<td>
+<p>Node iterator.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link7">Constructors, destructor, and related.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>virtual</b>
+ ~basic_tree_assoc_cntnr
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Destructor.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link8">Policy access methods.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a href = "#cmp_fn3735929186">cmp_fn</a> &amp;
+ get_cmp_fn
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Access to the <a href = "#cmp_fn3735929186"><tt>cmp_fn</tt></a> object.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>const</b> <a href = "#cmp_fn3735929186">cmp_fn</a> &amp;
+ get_cmp_fn
+ () <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Const access to the <a href = "#cmp_fn3735929186"><tt>cmp_fn</tt></a> object.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a href = "#node_updator3735929843">node_updator</a> &amp;
+ get_node_updator
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Access to the <a href = "#node_updator3735929843"><tt>node_updator</tt></a> object.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>const</b> <a href = "#node_updator3735929843">node_updator</a> &amp;
+ get_node_updator
+ () <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Const access to the <a href = "#node_updator3735929843"><tt>node_updator</tt></a> object.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link9">Erase methods.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>inline</b> <a href = "#size_type3735929547">size_type</a>
+ erase
+ (<a href = "#const_key_reference3735929552">const_key_reference</a> r_key)</pre>
+
+
+</td>
+
+<td>
+<p>Erases the value_type associated with <font color = "#666666"><tt>r_key</tt></font>; returns the number of value_types erased (0 or 1).</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <a href = "#iterator3735929433">iterator</a>
+ erase
+ (<a href = "#iterator3735929433">iterator</a> it)</pre>
+
+
+</td>
+
+<td>
+<p>Erases the value_type corresponding to the <a href = "#iterator3735929433"><tt>iterator</tt></a> <font color = "#666666"><tt>it</tt></font>. Returns the <a href = "#iterator3735929433"><tt>iterator</tt></a> corresponding to the next value_type.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link10">Node-Iteration methods.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>inline</b> <a href = "#node_iterator3735929950">node_iterator</a>
+ node_begin
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Returns a <a href = "#node_iterator3735929950"><tt>node_iterator</tt></a> corresponding to the value_type at the root of the tree.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <a href = "#const_node_iterator3735929535">const_node_iterator</a>
+ node_begin
+ () <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Returns a <a href = "#const_node_iterator3735929535"><tt>const_node_iterator</tt></a> corresponding to the value_type at the root of the tree.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <a href = "#node_iterator3735929950">node_iterator</a>
+ node_end
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Returns a <a href = "#node_iterator3735929950"><tt>node_iterator</tt></a> corresponding to a value_type just after a leaf of the tree.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <a href = "#const_node_iterator3735929535">const_node_iterator</a>
+ node_end
+ () <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Returns a <a href = "#const_node_iterator3735929535"><tt>const_node_iterator</tt></a> corresponding to a value_type just after a leaf of the tree.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link11">Split and join methods.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>void</b>
+ join
+ (<font color = "olive">basic_tree_assoc_cntnr</font> &amp;r_other)</pre>
+
+
+</td>
+
+<td>
+<p>Joins two trees. When this function returns, <font color = "#666666"><tt>r_other</tt></font> will be empty.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <b>void</b>
+ split
+ (<a href = "#const_key_reference3735929552">const_key_reference</a> r_key,
+ <font color = "olive">basic_tree_assoc_cntnr</font> &amp;r_other)</pre>
+
+
+</td>
+
+<td>
+<p>Joins two trees. When this function returns, <font color = "#666666"><tt>r_other</tt></font> will be empty.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+
+
+</body>
+
+</html>
+
+
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/basic_tree_assoc_cntnr_rev_it.html b/libstdc++-v3/docs/html/ext/pb_assoc/basic_tree_assoc_cntnr_rev_it.html
new file mode 100644
index 0000000..b9596f3
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/basic_tree_assoc_cntnr_rev_it.html
@@ -0,0 +1,771 @@
+
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+
+
+<html>
+<head>
+<title>basic_tree_assoc_cntnr Interface
+</title>
+
+</head>
+
+<body>
+<h1>
+<tt>basic_tree_assoc_cntnr
+</tt>
+
+ Interface
+
+
+</h1>
+
+<p>A basic tree-based associative container specialized for underlying data-structure which do not support reverse iteration.
+</p>
+
+<ol>
+<li>
+<a href = "../../../../include/ext/pb_assoc/assoc_cntnr.hpp"><tt>assoc_cntnr.hpp</tt>
+</a>
+
+</li>
+
+<li>
+<a href = "#link1">Template parameters.
+</a>
+
+</li>
+
+<li>
+<a href = "#link2">Base classes.
+</a>
+
+</li>
+
+<li>
+Public Types and Constants:
+
+
+<ol>
+<li>
+<a href = "#link3">General container definitions.
+</a>
+
+</li>
+
+<li>
+<a href = "#link4">Key-type definitions.
+</a>
+
+</li>
+
+<li>
+<a href = "#link5">Policy definitions.
+</a>
+
+</li>
+
+<li>
+<a href = "#link6">Iterator definitions.
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+<li>
+Public Methods:
+
+
+<ol>
+<li>
+<a href = "#link7">Constructors, destructor, and related.
+</a>
+
+</li>
+
+<li>
+<a href = "#link8">Policy access methods.
+</a>
+
+</li>
+
+<li>
+<a href = "#link9">Erase methods.
+</a>
+
+</li>
+
+<li>
+<a href = "#link10">Node-Iteration methods.
+</a>
+
+</li>
+
+<li>
+<a href = "#link11">Split and join methods.
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+</ol>
+
+
+<h2>
+<a name = "link1">Template parameters.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "20%" ALIGN = "left"><b>Parameter</b></TD><TD Width = "50%" ALIGN = "left"><b>Description</b></TD><TD Width = "30%" ALIGN = "left"><b>Default Value</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "Key3735928856">Key</a></pre>
+
+
+</td>
+
+<td>
+<p>Key type.</p>
+
+
+</td>
+
+<td>
+-
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "Data3735928937">Data</a></pre>
+
+
+</td>
+
+<td>
+<p>Data type.</p>
+
+
+</td>
+
+<td>
+-
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "Cmp_Fn3735929122">Cmp_Fn</a></pre>
+
+
+</td>
+
+<td>
+<p>Comparison functor.</p>
+
+
+</td>
+
+<td>
+-
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "Node_Updator3735929779">Node_Updator</a></pre>
+
+
+</td>
+
+<td>
+<p>Node updator type.</p>
+
+
+<p><a href = "concepts.html#concepts_node_invariants">Node Invariants</a> explains this concept.</p>
+
+
+</td>
+
+<td>
+-
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "Allocator3735929488">Allocator</a></pre>
+
+
+</td>
+
+<td>
+<p>Allocator type.</p>
+
+
+</td>
+
+<td>
+-
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link2">Base classes.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "80%" ALIGN = "left"><b>Class</b></TD><TD Width = "20%" ALIGN = "left"><b>Derivation Type</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a href = "#Node_Updator3735929779">Node_Updator</a></pre>
+
+
+</td>
+
+<td>
+<p>public</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link3">General container definitions.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "30%" ALIGN = "left"><b>Type</b></TD><TD Width = "55%" ALIGN = "left"><b>Definition</b></TD><TD Width = "15%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "size_type3735929547">size_type</a></pre>
+
+
+</td>
+
+<td>
+<pre><b>typename</b> <a href = "#Allocator3735929488">Allocator</a>::size_type</pre>
+
+
+</td>
+
+<td>
+<p>Size type.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link4">Key-type definitions.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "30%" ALIGN = "left"><b>Type</b></TD><TD Width = "55%" ALIGN = "left"><b>Definition</b></TD><TD Width = "15%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "const_key_reference3735929552">const_key_reference</a></pre>
+
+
+</td>
+
+<td>
+<pre><b>typename</b> <a href = "#Allocator3735929488">Allocator</a>::<b>template</b> rebind&lt;
+ <a href = "#Key3735928856">Key</a>&gt;::other::const_reference</pre>
+
+
+</td>
+
+<td>
+<p>Const key reference type.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link5">Policy definitions.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "30%" ALIGN = "left"><b>Type</b></TD><TD Width = "55%" ALIGN = "left"><b>Definition</b></TD><TD Width = "15%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "cmp_fn3735929186">cmp_fn</a></pre>
+
+
+</td>
+
+<td>
+<pre><a href = "#Cmp_Fn3735929122">Cmp_Fn</a></pre>
+
+
+</td>
+
+<td>
+<p>Comparison functor type.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "node_updator3735929843">node_updator</a></pre>
+
+
+</td>
+
+<td>
+<pre><a href = "#Node_Updator3735929779">Node_Updator</a></pre>
+
+
+</td>
+
+<td>
+<p>Node updator type.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link6">Iterator definitions.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "30%" ALIGN = "left"><b>Type</b></TD><TD Width = "55%" ALIGN = "left"><b>Definition</b></TD><TD Width = "15%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "const_iterator3735930079">const_iterator</a></pre>
+
+
+</td>
+
+<td>
+<pre>Underlying data-structure's const range-type iterator.</pre>
+
+
+</td>
+
+<td>
+<p>Const range-type iterator.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "iterator3735929433">iterator</a></pre>
+
+
+</td>
+
+<td>
+<pre>Underlying data-structure's range-type iterator.</pre>
+
+
+</td>
+
+<td>
+<p>Range-type iterator.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "const_node_iterator3735929535">const_node_iterator</a></pre>
+
+
+</td>
+
+<td>
+<pre><a href = "basic_tree_assoc_cntnr_const_node_iterator.html"><tt><font color = "olive">basic_tree_assoc_cntnr</font>::const_node_iterator</tt></a></pre>
+
+
+</td>
+
+<td>
+<p>Const node iterator.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "node_iterator3735929950">node_iterator</a></pre>
+
+
+</td>
+
+<td>
+<pre><a href = "basic_tree_assoc_cntnr_node_iterator.html"><tt><font color = "olive">basic_tree_assoc_cntnr</font>::node_iterator</tt></a></pre>
+
+
+</td>
+
+<td>
+<p>Node iterator.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link7">Constructors, destructor, and related.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>virtual</b>
+ ~basic_tree_assoc_cntnr
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Destructor.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link8">Policy access methods.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a href = "#cmp_fn3735929186">cmp_fn</a> &amp;
+ get_cmp_fn
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Access to the <a href = "#cmp_fn3735929186"><tt>cmp_fn</tt></a> object.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>const</b> <a href = "#cmp_fn3735929186">cmp_fn</a> &amp;
+ get_cmp_fn
+ () <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Const access to the <a href = "#cmp_fn3735929186"><tt>cmp_fn</tt></a> object.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a href = "#node_updator3735929843">node_updator</a> &amp;
+ get_node_updator
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Access to the <a href = "#node_updator3735929843"><tt>node_updator</tt></a> object.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>const</b> <a href = "#node_updator3735929843">node_updator</a> &amp;
+ get_node_updator
+ () <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Const access to the <a href = "#node_updator3735929843"><tt>node_updator</tt></a> object.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link9">Erase methods.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>inline</b> <a href = "#size_type3735929547">size_type</a>
+ erase
+ (<a href = "#const_key_reference3735929552">const_key_reference</a> r_key)</pre>
+
+
+</td>
+
+<td>
+<p>Erases the value_type associated with <font color = "#666666"><tt>r_key</tt></font>; returns the number of value_types erased (0 or 1).</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <a href = "#iterator3735929433">iterator</a>
+ erase
+ (<a href = "#iterator3735929433">iterator</a> it)</pre>
+
+
+</td>
+
+<td>
+<p>Erases the value_type corresponding to the <a href = "#iterator3735929433"><tt>iterator</tt></a> <font color = "#666666"><tt>it</tt></font>. Returns the <a href = "#iterator3735929433"><tt>iterator</tt></a> corresponding to the next value_type.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link10">Node-Iteration methods.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>inline</b> <a href = "#node_iterator3735929950">node_iterator</a>
+ node_begin
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Returns a <a href = "#node_iterator3735929950"><tt>node_iterator</tt></a> corresponding to the value_type at the root of the tree.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <a href = "#const_node_iterator3735929535">const_node_iterator</a>
+ node_begin
+ () <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Returns a <a href = "#const_node_iterator3735929535"><tt>const_node_iterator</tt></a> corresponding to the value_type at the root of the tree.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <a href = "#node_iterator3735929950">node_iterator</a>
+ node_end
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Returns a <a href = "#node_iterator3735929950"><tt>node_iterator</tt></a> corresponding to a value_type just after a leaf of the tree.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <a href = "#const_node_iterator3735929535">const_node_iterator</a>
+ node_end
+ () <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Returns a <a href = "#const_node_iterator3735929535"><tt>const_node_iterator</tt></a> corresponding to a value_type just after a leaf of the tree.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link11">Split and join methods.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>void</b>
+ join
+ (<font color = "olive">basic_tree_assoc_cntnr</font> &amp;r_other)</pre>
+
+
+</td>
+
+<td>
+<p>Joins two trees. When this function returns, <font color = "#666666"><tt>r_other</tt></font> will be empty.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <b>void</b>
+ split
+ (<a href = "#const_key_reference3735929552">const_key_reference</a> r_key,
+ <font color = "olive">basic_tree_assoc_cntnr</font> &amp;r_other)</pre>
+
+
+</td>
+
+<td>
+<p>Joins two trees. When this function returns, <font color = "#666666"><tt>r_other</tt></font> will be empty.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+
+
+</body>
+
+</html>
+
+
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/basic_tree_ds_tag.html b/libstdc++-v3/docs/html/ext/pb_assoc/basic_tree_ds_tag.html
new file mode 100644
index 0000000..e28c0b3
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/basic_tree_ds_tag.html
@@ -0,0 +1,74 @@
+
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+
+
+<html>
+<head>
+<title>basic_tree_ds_tag Interface
+</title>
+
+</head>
+
+<body>
+<h1>
+<tt>basic_tree_ds_tag
+</tt>
+
+ Interface
+
+
+</h1>
+
+<p>Basic tree data-structure tag.
+</p>
+
+<ol>
+<li>
+<a href = "../../../../include/ext/pb_assoc/ds_trait.hpp"><tt>ds_trait.hpp</tt>
+</a>
+
+</li>
+
+<li>
+<a href = "#link1">Base classes.
+</a>
+
+</li>
+
+</ol>
+
+
+<h2>
+<a name = "link1">Base classes.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "80%" ALIGN = "left"><b>Class</b></TD><TD Width = "20%" ALIGN = "left"><b>Derivation Type</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a href = "basic_ds_tag.html"><tt>basic_ds_tag</tt></a></pre>
+
+
+</td>
+
+<td>
+<p>public</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+
+
+</body>
+
+</html>
+
+
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/cc_hash_assoc_cntnr.html b/libstdc++-v3/docs/html/ext/pb_assoc/cc_hash_assoc_cntnr.html
new file mode 100644
index 0000000..8124e4b
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/cc_hash_assoc_cntnr.html
@@ -0,0 +1,679 @@
+
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+
+
+<html>
+<head>
+<title>cc_hash_assoc_cntnr Interface
+</title>
+
+</head>
+
+<body>
+<h1>
+<tt>cc_hash_assoc_cntnr
+</tt>
+
+ Interface
+
+
+</h1>
+
+<p>A collision-chaining hash-based associative container.
+</p>
+
+<ol>
+<li>
+<a href = "../../../../include/ext/pb_assoc/assoc_cntnr.hpp"><tt>assoc_cntnr.hpp</tt>
+</a>
+
+</li>
+
+<li>
+<a href = "#link1">Template parameters.
+</a>
+
+</li>
+
+<li>
+<a href = "#link2">Base classes.
+</a>
+
+</li>
+
+<li>
+Public Types and Constants:
+
+
+<ol>
+<li>
+<a href = "#link3">Policy definitions.
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+<li>
+Public Methods:
+
+
+<ol>
+<li>
+<a href = "#link4">Constructors, destructor, and related.
+</a>
+
+</li>
+
+<li>
+<a href = "#link5">Policy access methods.
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+</ol>
+
+
+<h2>
+<a name = "link1">Template parameters.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "20%" ALIGN = "left"><b>Parameter</b></TD><TD Width = "50%" ALIGN = "left"><b>Description</b></TD><TD Width = "30%" ALIGN = "left"><b>Default Value</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "Key3735928856">Key</a></pre>
+
+
+</td>
+
+<td>
+<p>Key type.</p>
+
+
+</td>
+
+<td>
+-
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "Data3735928937">Data</a></pre>
+
+
+</td>
+
+<td>
+<p>Data type.</p>
+
+
+</td>
+
+<td>
+-
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "Hash_Fn3735929222">Hash_Fn</a></pre>
+
+
+</td>
+
+<td>
+<p>Hash functor.</p>
+
+
+</td>
+
+<td>
+<pre>__gnu_cxx::hash&lt;<a href = "#Key3735928856">Key</a>&gt;</pre>if using gcc;<pre>stdext::hash_value&lt;<a href = "#Key3735928856">Key</a>&gt;</pre>if using Visual C++ .net
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "Eq_Fn3735929016">Eq_Fn</a></pre>
+
+
+</td>
+
+<td>
+<p>Equivalence functor.</p>
+
+
+</td>
+
+<td>
+<pre>std::equal_to&lt;<a href = "#Key3735928856">Key</a>&gt;</pre>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "Comb_Hash_Fn3735929702">Comb_Hash_Fn</a></pre>
+
+
+</td>
+
+<td>
+<p>Combining hash functor.</p>
+
+
+<p>If <a href = "#Hash_Fn3735929222">Hash_Fn</a> is not <a href = "null_hash_fn.html"><tt>null_hash_fn</tt></a>, then this is the <a href = "concepts.html#concepts_hash_fns">range_hashing function</a> functor; otherwise, this is the <a href = "concepts.html#concepts_hash_fns">ranged_hash function</a> functor.</p>
+
+
+</td>
+
+<td>
+<pre><a href = "direct_mask_range_hashing.html">direct_mask_range_hashing</a>&lt;
+ <a href = "#Allocator3735929488">Allocator</a>&gt;</pre>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "Resize_Policy3735929904">Resize_Policy</a></pre>
+
+
+</td>
+
+<td>
+<p>Resize policy.</p>
+
+
+</td>
+
+<td>
+If <tt><a href = "#comb_hash_fn3735929798">comb_hash_fn</a></tt> is <tt><a href = "direct_mask_range_hashing.html">direct_mask_range_hashing&lt;&gt;</a></tt>, then <pre><a href = "hash_standard_resize_policy.html">hash_standard_resize_policy</a>&lt;
+ <a href = "hash_exponential_size_policy.html">hash_exponential_size_policy</a>&lt;
+ <b>typename</b> <a href = "#comb_hash_fn3735929798">comb_hash_fn</a>::size_type&gt;,
+ <a href = "hash_load_check_resize_trigger.html">hash_load_check_resize_trigger</a>&lt;
+ <b>typename</b> <a href = "#comb_hash_fn3735929798">comb_hash_fn</a>::size_type&gt;,
+ <b>false</b>,
+ <b>typename</b> <a href = "#comb_hash_fn3735929798">comb_hash_fn</a>::size_type&gt;</pre>otherwise, <pre><a href = "hash_standard_resize_policy.html">hash_standard_resize_policy</a>&lt;
+ <a href = "hash_exponential_size_policy.html"><tt>hash_prime_size_policy</tt></a>&lt;
+ <b>typename</b> <a href = "#comb_hash_fn3735929798">comb_hash_fn</a>::size_type&gt;,
+ <a href = "hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>&lt;
+ <b>typename</b> <a href = "#comb_hash_fn3735929798">comb_hash_fn</a>::size_type&gt;,
+ <b>false</b>,
+ <b>typename</b> <a href = "#comb_hash_fn3735929798">comb_hash_fn</a>::size_type&gt;</pre>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "Store_Hash3735929567">Store_Hash</a></pre>
+
+
+</td>
+
+<td>
+<p>Indicates whether the hash value will be stored along with each key.</p>
+
+
+<p>If <tt><a href = "#hash_fn3735929286">hash_fn</a></tt> is <tt><a href = "null_hash_fn.html">null_hash_fn</a></tt>, then the container will not compile if this value is <tt><b>true</b></tt></p>
+
+
+</td>
+
+<td>
+<pre><tt><b>false</b></tt></pre>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "Allocator3735929488">Allocator</a></pre>
+
+
+</td>
+
+<td>
+<p>Allocator type.</p>
+
+
+</td>
+
+<td>
+<pre>std::allocator&lt;<b>char</b>&gt;</pre>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link2">Base classes.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "80%" ALIGN = "left"><b>Class</b></TD><TD Width = "20%" ALIGN = "left"><b>Derivation Type</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a href = "#Comb_Hash_Fn3735929702">Comb_Hash_Fn</a></pre>
+
+
+</td>
+
+<td>
+<p>public</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a href = "basic_hash_assoc_cntnr.html"<tt>basic_hash_assoc_cntnr</tt></a></pre>
+
+
+</td>
+
+<td>
+<p>public</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link3">Policy definitions.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "30%" ALIGN = "left"><b>Type</b></TD><TD Width = "55%" ALIGN = "left"><b>Definition</b></TD><TD Width = "15%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "comb_hash_fn3735929798">comb_hash_fn</a></pre>
+
+
+</td>
+
+<td>
+<pre><a href = "#Comb_Hash_Fn3735929702">Comb_Hash_Fn</a></pre>
+
+
+</td>
+
+<td>
+<p>Combining hash functor type.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link4">Constructors, destructor, and related.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre> cc_hash_assoc_cntnr
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Default constructor.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre> cc_hash_assoc_cntnr
+ (<b>const</b> <a href = "#Hash_Fn3735929222">Hash_Fn</a> &amp;r_hash_fn)</pre>
+
+
+</td>
+
+<td>
+<p>Constructor taking some policy objects. <font color = "#666666"><tt>r_hash_fn</tt></font> will be copied by the <a href = "#Hash_Fn3735929222"><tt>Hash_Fn</tt></a> object of the container object.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre> cc_hash_assoc_cntnr
+ (<b>const</b> <a href = "#Hash_Fn3735929222">Hash_Fn</a> &amp;r_hash_fn,
+ <b>const</b> <a href = "#Eq_Fn3735929016">Eq_Fn</a> &amp;r_eq_fn)</pre>
+
+
+</td>
+
+<td>
+<p>Constructor taking some policy objects. <font color = "#666666"><tt>r_hash_fn</tt></font> will be copied by the <a href = "#Hash_Fn3735929222"><tt>Hash_Fn</tt></a> object of the container object, and <font color = "#666666"><tt>r_eq_fn</tt></font> will be copied by the <a href = "#Eq_Fn3735929016"><tt>Eq_Fn</tt></a> object of the container object.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre> cc_hash_assoc_cntnr
+ (<b>const</b> <a href = "#Hash_Fn3735929222">Hash_Fn</a> &amp;r_hash_fn,
+ <b>const</b> <a href = "#Eq_Fn3735929016">Eq_Fn</a> &amp;r_eq_fn,
+ <b>const</b> <a href = "#Comb_Hash_Fn3735929702">Comb_Hash_Fn</a> &amp;r_comb_hash_fn)</pre>
+
+
+</td>
+
+<td>
+<p>Constructor taking some policy objects. <font color = "#666666"><tt>r_hash_fn</tt></font> will be copied by the <a href = "#Hash_Fn3735929222"><tt>Hash_Fn</tt></a> object of the container object, <font color = "#666666"><tt>r_eq_fn</tt></font> will be copied by the <a href = "#Eq_Fn3735929016"><tt>Eq_Fn</tt></a> object of the container object, and <font color = "#666666"><tt>r_comb_hash_fn</tt></font> will be copied by the <a href = "#Comb_Hash_Fn3735929702"><tt>Comb_Hash_Fn</tt></a> object of the container object.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre> cc_hash_assoc_cntnr
+ (<b>const</b> <a href = "#Hash_Fn3735929222">Hash_Fn</a> &amp;r_hash_fn,
+ <b>const</b> <a href = "#Eq_Fn3735929016">Eq_Fn</a> &amp;r_eq_fn,
+ <b>const</b> <a href = "#Comb_Hash_Fn3735929702">Comb_Hash_Fn</a> &amp;r_comb_hash_fn,
+ <b>const</b> <a href = "#Resize_Policy3735929904">Resize_Policy</a> &amp;r_resize_policy)</pre>
+
+
+</td>
+
+<td>
+<p>Constructor taking some policy objects. <font color = "#666666"><tt>r_hash_fn</tt></font> will be copied by the <a href = "#Hash_Fn3735929222"><tt>Hash_Fn</tt></a> object of the container object, <font color = "#666666"><tt>r_eq_fn</tt></font> will be copied by the <a href = "#Eq_Fn3735929016"><tt>Eq_Fn</tt></a> object of the container object, <font color = "#666666"><tt>r_comb_hash_fn</tt></font> will be copied by the <a href = "#Comb_Hash_Fn3735929702"><tt>Comb_Hash_Fn</tt></a> object of the container object, and <font color = "#666666"><tt>r_resize_policy</tt></font> will be copied by the <a href = "#Resize_Policy3735929904"><tt>Resize_Policy</tt></a> object of the container object.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>template</b>&lt;
+ <b>class</b> It&gt;
+ cc_hash_assoc_cntnr
+ (It first_it,
+ It last_it)</pre>
+
+
+</td>
+
+<td>
+<p>Constructor taking iterators to a range of value_types. The value_types between <font color = "#666666"><tt>first_it</tt></font> and <font color = "#666666"><tt>last_it</tt></font> will be inserted into the container object.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>template</b>&lt;
+ <b>class</b> It&gt;
+ cc_hash_assoc_cntnr
+ (It first_it,
+ It last_it,
+ <b>const</b> <a href = "#Hash_Fn3735929222">Hash_Fn</a> &amp;r_hash_fn)</pre>
+
+
+</td>
+
+<td>
+<p>Constructor taking iterators to a range of value_types and some policy objects. The value_types between <font color = "#666666"><tt>first_it</tt></font> and <font color = "#666666"><tt>last_it</tt></font> will be inserted into the container object.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>template</b>&lt;
+ <b>class</b> It&gt;
+ cc_hash_assoc_cntnr
+ (It first_it,
+ It last_it,
+ <b>const</b> <a href = "#Hash_Fn3735929222">Hash_Fn</a> &amp;r_hash_fn,
+ <b>const</b> <a href = "#Eq_Fn3735929016">Eq_Fn</a> &amp;r_eq_fn)</pre>
+
+
+</td>
+
+<td>
+<p>Constructor taking iterators to a range of value_types and some policy objects The value_types between <font color = "#666666"><tt>first_it</tt></font> and <font color = "#666666"><tt>last_it</tt></font> will be inserted into the container object. <font color = "#666666"><tt>r_hash_fn</tt></font> will be copied by the <a href = "#Hash_Fn3735929222"><tt>Hash_Fn</tt></a> object of the container object, and <font color = "#666666"><tt>r_eq_fn</tt></font> will be copied by the <a href = "#Eq_Fn3735929016"><tt>Eq_Fn</tt></a> object of the container object.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>template</b>&lt;
+ <b>class</b> It&gt;
+ cc_hash_assoc_cntnr
+ (It first_it,
+ It last_it,
+ <b>const</b> <a href = "#Hash_Fn3735929222">Hash_Fn</a> &amp;r_hash_fn,
+ <b>const</b> <a href = "#Eq_Fn3735929016">Eq_Fn</a> &amp;r_eq_fn,
+ <b>const</b> <a href = "#Comb_Hash_Fn3735929702">Comb_Hash_Fn</a> &amp;r_comb_hash_fn)</pre>
+
+
+</td>
+
+<td>
+<p>Constructor taking iterators to a range of value_types and some policy objects The value_types between <font color = "#666666"><tt>first_it</tt></font> and <font color = "#666666"><tt>last_it</tt></font> will be inserted into the container object. <font color = "#666666"><tt>r_hash_fn</tt></font> will be copied by the <a href = "#Hash_Fn3735929222"><tt>Hash_Fn</tt></a> object of the container object, <font color = "#666666"><tt>r_eq_fn</tt></font> will be copied by the <a href = "#Eq_Fn3735929016"><tt>Eq_Fn</tt></a> object of the container object, and <font color = "#666666"><tt>r_comb_hash_fn</tt></font> will be copied by the <a href = "#Comb_Hash_Fn3735929702"><tt>Comb_Hash_Fn</tt></a> object of the container object.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>template</b>&lt;
+ <b>class</b> It&gt;
+ cc_hash_assoc_cntnr
+ (It first_it,
+ It last_it,
+ <b>const</b> <a href = "#Hash_Fn3735929222">Hash_Fn</a> &amp;r_hash_fn,
+ <b>const</b> <a href = "#Eq_Fn3735929016">Eq_Fn</a> &amp;r_eq_fn,
+ <b>const</b> <a href = "#Comb_Hash_Fn3735929702">Comb_Hash_Fn</a> &amp;r_comb_hash_fn,
+ <b>const</b> <a href = "#Resize_Policy3735929904">Resize_Policy</a> &amp;r_resize_policy)</pre>
+
+
+</td>
+
+<td>
+<p>Constructor taking iterators to a range of value_types and some policy objects The value_types between <font color = "#666666"><tt>first_it</tt></font> and <font color = "#666666"><tt>last_it</tt></font> will be inserted into the container object. <font color = "#666666"><tt>r_hash_fn</tt></font> will be copied by the <a href = "#Hash_Fn3735929222"><tt>Hash_Fn</tt></a> object of the container object, <font color = "#666666"><tt>r_eq_fn</tt></font> will be copied by the <a href = "#Eq_Fn3735929016"><tt>Eq_Fn</tt></a> object of the container object, <font color = "#666666"><tt>r_comb_hash_fn</tt></font> will be copied by the <a href = "#Comb_Hash_Fn3735929702"><tt>Comb_Hash_Fn</tt></a> object of the container object, and <font color = "#666666"><tt>r_resize_policy</tt></font> will be copied by the <a href = "#Resize_Policy3735929904"><tt>Resize_Policy</tt></a> object of the container object.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre> cc_hash_assoc_cntnr
+ (<b>const</b> <font color = "olive">cc_hash_assoc_cntnr</font> &amp;r_other)</pre>
+
+
+</td>
+
+<td>
+<p>Copy constructor.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>virtual</b>
+ ~cc_hash_assoc_cntnr
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Destructor.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><font color = "olive">cc_hash_assoc_cntnr</font> &amp;
+ <b>operator</b>=
+ (<b>const</b> <font color = "olive">cc_hash_assoc_cntnr</font> &amp;r_other)</pre>
+
+
+</td>
+
+<td>
+<p>Assignment operator.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>void</b>
+ swap
+ (<font color = "olive">cc_hash_assoc_cntnr</font> &amp;r_other)</pre>
+
+
+</td>
+
+<td>
+<p>Swaps content.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link5">Policy access methods.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a href = "#comb_hash_fn3735929798">comb_hash_fn</a> &amp;
+ get_comb_hash_fn
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Access to the <a href = "#comb_hash_fn3735929798"><tt>comb_hash_fn</tt></a> object.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>const</b> <a href = "#comb_hash_fn3735929798">comb_hash_fn</a> &amp;
+ get_comb_hash_fn
+ () <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Const access to the <a href = "#comb_hash_fn3735929798"><tt>comb_hash_fn</tt></a> object.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+
+
+</body>
+
+</html>
+
+
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/cc_hash_ds_tag.html b/libstdc++-v3/docs/html/ext/pb_assoc/cc_hash_ds_tag.html
new file mode 100644
index 0000000..87b724e
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/cc_hash_ds_tag.html
@@ -0,0 +1,74 @@
+
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+
+
+<html>
+<head>
+<title>cc_hash_ds_tag Interface
+</title>
+
+</head>
+
+<body>
+<h1>
+<tt>cc_hash_ds_tag
+</tt>
+
+ Interface
+
+
+</h1>
+
+<p>Collision-chaining hash data-structure tag.
+</p>
+
+<ol>
+<li>
+<a href = "../../../../include/ext/pb_assoc/ds_trait.hpp"><tt>ds_trait.hpp</tt>
+</a>
+
+</li>
+
+<li>
+<a href = "#link1">Base classes.
+</a>
+
+</li>
+
+</ol>
+
+
+<h2>
+<a name = "link1">Base classes.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "80%" ALIGN = "left"><b>Class</b></TD><TD Width = "20%" ALIGN = "left"><b>Derivation Type</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a href = "basic_hash_ds_tag.html"><tt>basic_hash_ds_tag</tt></a></pre>
+
+
+</td>
+
+<td>
+<p>public</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+
+
+</body>
+
+</html>
+
+
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/cc_hash_max_collision_check_resize_trigger.html b/libstdc++-v3/docs/html/ext/pb_assoc/cc_hash_max_collision_check_resize_trigger.html
new file mode 100644
index 0000000..0b19045
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/cc_hash_max_collision_check_resize_trigger.html
@@ -0,0 +1,701 @@
+
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+
+
+<html>
+<head>
+<title>cc_hash_max_collision_check_resize_trigger Interface
+</title>
+
+</head>
+
+<body>
+<h1>
+<tt>cc_hash_max_collision_check_resize_trigger
+</tt>
+
+ Interface
+
+
+</h1>
+
+<p>A resize trigger policy based on collision checks. It keeps the simulated load factor lower than some given load factor.
+</p>
+
+<ol>
+<li>
+<a href = "../../../../include/ext/pb_assoc/hash_policy.hpp"><tt>hash_policy.hpp</tt>
+</a>
+
+</li>
+
+<li>
+<a href = "#link1">Template parameters.
+</a>
+
+</li>
+
+<li>
+Public Types and Constants:
+
+
+<ol>
+<li>
+<a href = "#link2">General definitions.
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+<li>
+Public Methods:
+
+
+<ol>
+<li>
+<a href = "#link3">Constructors, destructor, and related.
+</a>
+
+</li>
+
+<li>
+<a href = "#link4">Load access methods.
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+<li>
+Protected Methods:
+
+
+<ol>
+<li>
+<a href = "#link5">Insert search notifications.
+</a>
+
+</li>
+
+<li>
+<a href = "#link6">Find search notifications.
+</a>
+
+</li>
+
+<li>
+<a href = "#link7">Erase search notifications.
+</a>
+
+</li>
+
+<li>
+<a href = "#link8">Content change notifications.
+</a>
+
+</li>
+
+<li>
+<a href = "#link9">Size change notifications.
+</a>
+
+</li>
+
+<li>
+<a href = "#link10">Queries.
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+</ol>
+
+
+<h2>
+<a name = "link1">Template parameters.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "20%" ALIGN = "left"><b>Parameter</b></TD><TD Width = "50%" ALIGN = "left"><b>Description</b></TD><TD Width = "30%" ALIGN = "left"><b>Default Value</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "External_Load_Access3735929540">External_Load_Access</a></pre>
+
+
+</td>
+
+<td>
+<p>Specifies whether the load factor can be accessed externally. The two options have different tradeoffs in terms of flexibility, genericity, and encapsulation.</p>
+
+
+</td>
+
+<td>
+<tt><b>false</b></tt>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "Size_Type3735929483">Size_Type</a></pre>
+
+
+</td>
+
+<td>
+<p>Size type.</p>
+
+
+</td>
+
+<td>
+size_t
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link2">General definitions.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "30%" ALIGN = "left"><b>Type</b></TD><TD Width = "55%" ALIGN = "left"><b>Definition</b></TD><TD Width = "15%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "size_type3735929547">size_type</a></pre>
+
+
+</td>
+
+<td>
+<pre><a href = "#Size_Type3735929483">Size_Type</a></pre>
+
+
+</td>
+
+<td>
+<p>Size type.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "external_load_access3735929604">external_load_access</a></pre>
+
+
+</td>
+
+<td>
+<pre><a href = "#External_Load_Access3735929540">External_Load_Access</a></pre>
+
+
+</td>
+
+<td>
+<p>Indicates whether loads can be accessed externally</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link3">Constructors, destructor, and related.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre> cc_hash_max_collision_check_resize_trigger
+ (float load = 0.5)</pre>
+
+
+</td>
+
+<td>
+<p>Default constructor, or constructor taking <font color = "#666666"><tt>load</tt></font>, a load factor which it will attempt to maintain.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>void</b>
+ swap
+ (<font color = "olive">cc_hash_max_collision_check_resize_trigger</font> &amp;r_other)</pre>
+
+
+</td>
+
+<td>
+<p>Swaps content.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link4">Load access methods.
+</a>
+
+</h2>
+
+<p> These methods are only available if the external access parameter is set.</p>
+
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>inline</b> float
+ get_load
+ () <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Returns a pair of the minimal and maximal loads, respectively.</p>
+
+
+<p>Calling this method will not compile when <a href = "#External_Load_Access3735929540"><tt>External_Load_Access</tt></a> == <tt><b>false</b></tt>.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link5">Insert search notifications.
+</a>
+
+</h2>
+
+<p>Notifications called during an insert operation.</p>
+
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>inline</b> <b>void</b>
+ notify_insert_search_start
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Notifies a search started.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <b>void</b>
+ notify_insert_search_collision
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Notifies a search encountered a collision.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <b>void</b>
+ notify_insert_search_end
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Notifies a search ended.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link6">Find search notifications.
+</a>
+
+</h2>
+
+<p>Notifications called during a find operation.</p>
+
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>inline</b> <b>void</b>
+ notify_find_search_start
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Notifies a search started.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <b>void</b>
+ notify_find_search_collision
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Notifies a search encountered a collision.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <b>void</b>
+ notify_find_search_end
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Notifies a search ended.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link7">Erase search notifications.
+</a>
+
+</h2>
+
+<p>Notifications called during an insert operation.</p>
+
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>inline</b> <b>void</b>
+ notify_erase_search_start
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Notifies a search started.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <b>void</b>
+ notify_erase_search_collision
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Notifies a search encountered a collision.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <b>void</b>
+ notify_erase_search_end
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Notifies a search ended.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link8">Content change notifications.
+</a>
+
+</h2>
+
+<p>Notifications called when the content of the table changes in a way that can affect the resize policy.</p>
+
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>inline</b> <b>void</b>
+ notify_inserted
+ (<a href = "#size_type3735929547">size_type</a> num_entries)</pre>
+
+
+</td>
+
+<td>
+<p>Notifies an element was inserted.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <b>void</b>
+ notify_erased
+ (<a href = "#size_type3735929547">size_type</a> num_entries)</pre>
+
+
+</td>
+
+<td>
+<p>Notifies an element was erased.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>void</b>
+ notify_cleared
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Notifies the table was cleared.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link9">Size change notifications.
+</a>
+
+</h2>
+
+<p>Notifications called when the table changes size.</p>
+
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>void</b>
+ notify_resized
+ (<a href = "#size_type3735929547">size_type</a> new_size)</pre>
+
+
+</td>
+
+<td>
+<p>Notifies the table was resized as a result of this object's signifying that a resize is needed.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>void</b>
+ notify_externally_resized
+ (<a href = "#size_type3735929547">size_type</a> new_size)</pre>
+
+
+</td>
+
+<td>
+<p>Notifies the table was resized externally.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link10">Queries.
+</a>
+
+</h2>
+
+<p>Called to query whether/how to resize.</p>
+
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>inline</b> <b>bool</b>
+ is_resize_needed
+ () <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Queries whether a resize is needed.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <b>bool</b>
+ is_grow_needed
+ (<a href = "#size_type3735929547">size_type</a> size, <a href = "#size_type3735929547">size_type</a> num_entries) <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Queries whether a grow is needed.</p>
+
+
+<p>This method is called only if this object indicated is needed.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <b>bool</b>
+ is_shrink_needed
+ (<a href = "#size_type3735929547">size_type</a> size, <a href = "#size_type3735929547">size_type</a> num_entries) <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Queries whether a shrink is needed.</p>
+
+
+<p>This method is called only if this object indicated is needed.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+
+
+</body>
+
+</html>
+
+
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/cc_hash_policy_cd.jpg b/libstdc++-v3/docs/html/ext/pb_assoc/cc_hash_policy_cd.jpg
new file mode 100644
index 0000000..63891a8
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/cc_hash_policy_cd.jpg
Binary files differ
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/cd.jpg b/libstdc++-v3/docs/html/ext/pb_assoc/cd.jpg
new file mode 100644
index 0000000..1b55544
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/cd.jpg
Binary files differ
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/component_requirements.html b/libstdc++-v3/docs/html/ext/pb_assoc/component_requirements.html
new file mode 100644
index 0000000..703e4e0
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/component_requirements.html
@@ -0,0 +1,51 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+<html>
+ <head>
+ <title>Component Requirements</title>
+ </head>
+ <body bgcolor = "white">
+ <h1>Component Requirements</h1>
+ <h2>Functional Requirements</h2>
+ <ol>
+ <li>
+ Keys:
+ <ol>
+ <li>
+ Key objects must be copy-constructible (they need not support assignment).
+ <li>
+ Key objects must be destructible.</li>
+ </ol>
+ <li>
+ Data:
+ <ol>
+ <li>
+ Data objects must be copy-constructible (they need not support assignment).
+ <LI>
+ Data objects must be default constructible.
+ <li>
+ Data objects must be destructible.</li>
+ </ol></li> </ol> <a name="exception_requirements">
+ <h2>Exception Requirements</h2>
+ </a>
+ <ol>
+ <li>
+ Keys:
+ <ol>
+ <li>
+ Key objects must not throw exceptions when destructed.
+ <li>
+ Key objects may throw exceptions when copy constructed.</li>
+ </ol>
+ <li>
+ Data:
+ <ol>
+ <li>
+ Data objects must must not throw exceptions when destructed.
+ <li>
+ Data objects may throw exceptions when copy constructed.</li>
+ </ol></li> </ol>
+ <HR>
+
+ </body>
+
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/compound_data_enabled_ms_tag.html b/libstdc++-v3/docs/html/ext/pb_assoc/compound_data_enabled_ms_tag.html
new file mode 100644
index 0000000..6b70c3f
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/compound_data_enabled_ms_tag.html
@@ -0,0 +1,41 @@
+
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+
+
+<html>
+<head>
+<title>compound_data_enabled_ms_tag Interface
+</title>
+
+</head>
+
+<body>
+<h1>
+<tt>compound_data_enabled_ms_tag
+</tt>
+
+ Interface
+
+
+</h1>
+
+<p>Mapping-semantics tag indicating that the container objects maps each key to some compound datum.
+</p>
+
+<ol>
+<li>
+<a href = "../../../../include/ext/pb_assoc/ms_trait.hpp"><tt>ms_trait.hpp</tt>
+</a>
+
+</li>
+
+</ol>
+
+
+
+
+</body>
+
+</html>
+
+
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/compound_data_type.html b/libstdc++-v3/docs/html/ext/pb_assoc/compound_data_type.html
new file mode 100644
index 0000000..c9fd7e0
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/compound_data_type.html
@@ -0,0 +1,128 @@
+
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+
+
+<html>
+<head>
+<title>compound_data_type Interface
+</title>
+
+</head>
+
+<body>
+<h1>
+<tt>compound_data_type
+</tt>
+
+ Interface
+
+
+</h1>
+
+<p>A data-policy indicating that an associative container has multiple mapping levels.
+</p>
+
+<ol>
+<li>
+<a href = "../../../../include/ext/pb_assoc/data_type.hpp"><tt>data_type.hpp</tt>
+</a>
+
+</li>
+
+<li>
+<a href = "#link1">Template parameters.
+</a>
+
+</li>
+
+<li>
+Public Types and Constants:
+
+
+<ol>
+<li>
+<a href = "#link2">General definitions.
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+</ol>
+
+
+<h2>
+<a name = "link1">Template parameters.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "20%" ALIGN = "left"><b>Parameter</b></TD><TD Width = "50%" ALIGN = "left"><b>Description</b></TD><TD Width = "30%" ALIGN = "left"><b>Default Value</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "Cntnr3735929076">Cntnr</a></pre>
+
+
+</td>
+
+<td>
+<p>(Associative) container type to which every key in the container maps.</p>
+
+
+</td>
+
+<td>
+-
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link2">General definitions.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "30%" ALIGN = "left"><b>Type</b></TD><TD Width = "55%" ALIGN = "left"><b>Definition</b></TD><TD Width = "15%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "cntnr3735929108">cntnr</a></pre>
+
+
+</td>
+
+<td>
+<pre><a href = "#Cntnr3735929076">Cntnr</a></pre>
+
+
+</td>
+
+<td>
+<p>The type of container which is the actual data type.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+
+
+</body>
+
+</html>
+
+
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/compound_ds_tag.html b/libstdc++-v3/docs/html/ext/pb_assoc/compound_ds_tag.html
new file mode 100644
index 0000000..c1cb9ce
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/compound_ds_tag.html
@@ -0,0 +1,77 @@
+
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+
+
+<html>
+<head>
+<title>compound_ds_tag Interface
+</title>
+
+</head>
+
+<body>
+<h1>
+<tt>compound_ds_tag
+</tt>
+
+ Interface
+
+
+</h1>
+
+<p>Compound data-structure tag.
+</p>
+
+<p>Indicates that the underlying data-structure is a composition of other data structures.
+</p>
+
+<ol>
+<li>
+<a href = "../../../../include/ext/pb_assoc/ds_trait.hpp"><tt>ds_trait.hpp</tt>
+</a>
+
+</li>
+
+<li>
+<a href = "#link1">Base classes.
+</a>
+
+</li>
+
+</ol>
+
+
+<h2>
+<a name = "link1">Base classes.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "80%" ALIGN = "left"><b>Class</b></TD><TD Width = "20%" ALIGN = "left"><b>Derivation Type</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a href = "basic_ds_tag.html"><tt>basic_ds_tag</tt></a></pre>
+
+
+</td>
+
+<td>
+<p>public</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+
+
+</body>
+
+</html>
+
+
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/concepts.html b/libstdc++-v3/docs/html/ext/pb_assoc/concepts.html
new file mode 100644
index 0000000..cd72958
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/concepts.html
@@ -0,0 +1,124 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+<html>
+<head>
+<title>Concepts</title>
+<meta name="GENERATOR" content="Microsoft Visual Studio .NET 7.1">
+<meta name="vs_targetSchema" content="http://schemas.microsoft.com/intellisense/ie5">
+</head>
+<body bgcolor = "white">
+<h1>Concepts</h1>
+
+<p>
+Following are some concepts used throughout the documentation.
+</p>
+
+<ol>
+ <li><a href = "#concepts_null_policies">Null Policy Classes</a></li>
+ <li><a href = "#concepts_find_and_range_iterators">Find and Range Iterators</a></li>
+ <li><a href = "#concepts_mapping_levels">Mapping Levels</a></li>
+</ol>
+
+<h2><a name = "concepts_null_policies">Null Policy Classes</a></h2>
+
+<p>
+ Associative containers are typically parameterized by various policies.
+For example, a hash-based associative
+container is parameterized by a hash-functor, transforming each key into an non-negative numerical type. Each such value is then further mapped into a position within the table.
+The mapping of a key into a position within the table is therefore a two-step process.
+</p>
+
+<p>
+In some
+cases, instantiations are <i>redundant</i>. For example, when the keys are integers, it is possible to use a <i>redundant</i>
+hash policy, which transforms each key into its value.
+</p>
+
+<p>
+ In some other cases, these policies are <i>irrelevent</i>. For example,
+a hash-based associative container might transform keys into positions within
+a table by a different method than the two-step method described above. In such a case, the hash functor is simply irrelevent.
+</p>
+
+<p>
+ <tt>pb_assoc</tt> uses special pre-defined &quot;null policies&quot; classes
+for these cases. Some null policies in <tt>pb_assoc</tt>
+are:
+</p>
+<ol>
+ <li <a href = "null_data_type.html"><tt>null_data_type</tt></a></li>
+ <li><a href = "null_node_updator.html"><tt>null_node_updator</tt></a></li>
+ <li><a href = "null_hash_fn.html"><tt>null_hash_fn</tt></a></li>
+ <li><a href = "null_probe_fn.html"><tt>null_probe_fn</tt></a></li>
+</ol>
+
+<p>
+A &quot;set&quot; in <tt>pb_assoc</tt> is an associative container with its <tt>Data_Parameter</tt> instantiated by
+<a href = "null_data_type.html"><tt>null_data_type</tt></a>.
+<a href = "tree_based_containers.html#node_invariants.html">Tree-Based Containers::Node Invariants</a>
+explains another case where a null policy is needed.
+</p>
+
+
+
+<h2><a name = "concepts_find_and_range_iterators">Find and Range Methods and Iterators</a></h2>
+
+<p>
+ Associative containers allow access to their elements via iterators. <i>E.g.</i>,
+<tt>find</tt> returns an iterator to an element with a given key and
+<tt>begin</tt> returns an iterator to the first element in the container.
+</p>
+
+<p>
+In general, there are two types of methods: <i>find types</i>, and <i>range types</i>.
+ Find-type
+methods return iterators corresponding to elements which have been found in some sense, as
+the container searched for them in order to access them (<i>i.e.</i>, via the
+<tt>find</tt> method) or searched for their location in order to insert them
+(<i>i.e.</i>, via the <tt>insert</tt> method). Range-type methods return iterators
+which can be used to traverse the range of all stored elements, (<i>i.e.</i>, via the
+<tt>begin</tt> and <tt>end</tt> methods).
+</p>
+
+<p>Correspondingly, in <tt>pb_assoc</tt> there are two types of iterators: <i>find type</i>
+iterators are returned by find methods, and range iterators are returned by range methods. For example,
+if <tt>T</tt> is any associative container with integer keys, and <tt>t</tt>
+is a container of type <tt>T</tt>,
+then the following snippet is valid:
+</p>
+
+<pre>
+<b>typename</b> T::find_iterator it0 = t.find(3);
+<b>typename</b> T::const_find_iterator it0 = t.find(3);
+
+<b>typename</b> T::iterator it0 = t.begin();
+<b>typename</b> T::const_iterator it0 = t.begin();
+</pre>
+
+
+<p>
+ This is motivated and explained further in
+<a href = "ds_gen.html#find_range">Data-Structure Genericity::Find-Type and Range-Type Methods and Iterators</a>, which also explains the relationship between find-type and range-type iterators.
+</p>
+
+<h2><a href = "#concepts_mapping_levels">Mapping Levels</a></h2>
+
+<p>
+ In <tt>pb_assoc</tt> &quot;multimaps&quot; are
+&quot;maps&quot; of &quot;sets&quot;. While this design allows efficient
+operations, it makes for cumbersome use at points. For example a
+&quot;multimap&quot; of integers to characters does not
+directly support <tt>inser(std::make_pair(2, 'b')</tt>, since 2 is mapped
+to a &quot;set&quot; of characters, and not to a character.
+</p>
+
+<p>
+ Consequently, <tt>pb_assoc</tt> contains a rebind-like mechanism so that
+containers can support such operations. To dispel ambiguity, container types are
+assigned mapping levels. &quot;Maps&quot; and &quot;sets&quot; have
+a mapping level 1, since they use a single association level. The &quot;multimap&quot;
+above has a mapping level 2, since it uses two association levels: one for integers, and one for characters. The rebind mechanism can be used to alter the association level. This is described in
+<a href = "ms_gen.html">Mapping Semantics</a>.
+</p>
+
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/contact.html b/libstdc++-v3/docs/html/ext/pb_assoc/contact.html
new file mode 100644
index 0000000..2eb28be
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/contact.html
@@ -0,0 +1,19 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+<html>
+<head>
+<title>Contact</title>
+
+<meta name="GENERATOR" content="Microsoft Visual Studio .NET 7.1">
+<meta name="vs_targetSchema" content="http://schemas.microsoft.com/intellisense/ie5">
+
+</head>
+<body bgcolor = "white">
+<h1>Contact</h1>
+
+<p>
+For anything relevant, please write to
+<a href = "mailto:pbassoc@gmail.com">pbassoc@gmail.com</a>
+</p>
+
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/counter_update_metadata.html b/libstdc++-v3/docs/html/ext/pb_assoc/counter_update_metadata.html
new file mode 100644
index 0000000..fb56b1a
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/counter_update_metadata.html
@@ -0,0 +1,101 @@
+
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+
+
+<html>
+<head>
+<title>counter_update_metadata Interface
+</title>
+
+</head>
+
+<body>
+<h1>
+<tt>counter_update_metadata
+</tt>
+
+ Interface
+
+
+</h1>
+
+<p>A list-update metadata type that moves elements to the front of the list based on the counter algorithm.
+</p>
+
+<ol>
+<li>
+<a href = "../../../../include/ext/pb_assoc/counter_update_policy.hpp"><tt>counter_update_policy.hpp</tt>
+</a>
+
+</li>
+
+<li>
+<a href = "#link1">Template parameters.
+</a>
+
+</li>
+
+<li>
+Public Types and Constants:
+
+
+<ol>
+<li>
+<a href = "#link2">General definitions.
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+</ol>
+
+
+<h2>
+<a name = "link1">Template parameters.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "20%" ALIGN = "left"><b>Parameter</b></TD><TD Width = "50%" ALIGN = "left"><b>Description</b></TD><TD Width = "30%" ALIGN = "left"><b>Default Value</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "Size_Type3735929483">Size_Type</a></pre>
+
+
+</td>
+
+<td>
+<p>Size type which will be used for counting the number of times a node was accessed.</p>
+
+
+</td>
+
+<td>
+size_t
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link2">General definitions.
+</a>
+
+</h2>
+
+
+
+</body>
+
+</html>
+
+
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/counter_update_policy.html b/libstdc++-v3/docs/html/ext/pb_assoc/counter_update_policy.html
new file mode 100644
index 0000000..c54fe37
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/counter_update_policy.html
@@ -0,0 +1,380 @@
+
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+
+
+<html>
+<head>
+<title>counter_update_policy Interface
+</title>
+
+</head>
+
+<body>
+<h1>
+<tt>counter_update_policy
+</tt>
+
+ Interface
+
+
+</h1>
+
+<p>A list-update policy that moves elements to the front of the list based on the counter algorithm.
+</p>
+
+<p>This class is likely to slightly change interface when random number generators become part of the C++ standard.
+</p>
+
+<ol>
+<li>
+<a href = "../../../../include/ext/pb_assoc/counter_update_policy.hpp"><tt>counter_update_policy.hpp</tt>
+</a>
+
+</li>
+
+<li>
+<a href = "#link1">Template parameters.
+</a>
+
+</li>
+
+<li>
+Public Types and Constants:
+
+
+<ol>
+<li>
+<a href = "#link2">Size definitions.
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+<li>
+Public Methods:
+
+
+<ol>
+<li>
+<a href = "#link3">Constructors, destructor, and related.
+</a>
+
+</li>
+
+<li>
+<a href = "#link4">Information methods.
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+<li>
+Protected Types and Constants:
+
+
+<ol>
+<li>
+<a href = "#link5">Metadata definitions.
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+<li>
+Protected Methods:
+
+
+<ol>
+<li>
+<a href = "#link6">Metadata operations.
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+</ol>
+
+
+<h2>
+<a name = "link1">Template parameters.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "20%" ALIGN = "left"><b>Parameter</b></TD><TD Width = "50%" ALIGN = "left"><b>Description</b></TD><TD Width = "30%" ALIGN = "left"><b>Default Value</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "Size_Type3735929483">Size_Type</a></pre>
+
+
+</td>
+
+<td>
+<p>Size type.</p>
+
+
+</td>
+
+<td>
+size_t
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "Metadata_Reference3735929465">Metadata_Reference</a></pre>
+
+
+</td>
+
+<td>
+<p>Metadata reference type.</p>
+
+
+</td>
+
+<td>
+<pre>std::allocator&lt;
+ <a href = "counter_update_metadata.html"><tt>counter_update_metadata</tt></a>&gt;::
+ reference
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link2">Size definitions.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "30%" ALIGN = "left"><b>Type</b></TD><TD Width = "55%" ALIGN = "left"><b>Definition</b></TD><TD Width = "15%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "size_type3735929547">size_type</a></pre>
+
+
+</td>
+
+<td>
+<pre><a href = "#Size_Type3735929483">Size_Type</a></pre>
+
+
+</td>
+
+<td>
+<p>Size type used for counting the number of times each node is accessed until the count is reset to 0 and the node moved to the front of the list.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link3">Constructors, destructor, and related.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre> counter_update_policy
+ (<a href = "#size_type3735929547">size_type</a> max_count = 5)</pre>
+
+
+</td>
+
+<td>
+<p>Constructor. <font color = "#666666"><tt>max_count</tt></font> determines the the number of times each node is accessed until the count is reset to 0 and the node moved to the front of the list.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>void</b>
+ swap
+ (<font color = "olive">counter_update_policy</font> &amp;r_other)</pre>
+
+
+</td>
+
+<td>
+<p>Swaps content.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link4">Information methods.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>inline</b>
+ <a href = "#size_type3735929547">size_type</a>
+ get_max_count
+ () <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Returns the max count of each metadata (number of times it is accessed until moved to the front of the list).</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link5">Metadata definitions.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "30%" ALIGN = "left"><b>Type</b></TD><TD Width = "55%" ALIGN = "left"><b>Definition</b></TD><TD Width = "15%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "metadata_type3735929937">metadata_type</a></pre>
+
+
+</td>
+
+<td>
+<pre><a href = "counter_update_metadata.html"><tt>counter_update_metadata</tt></a></pre>
+
+
+</td>
+
+<td>
+<p>Metadata on which this functor operates.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "metadata_reference3735929497">metadata_reference</a></pre>
+
+
+</td>
+
+<td>
+<pre><a href = "#Metadata_Reference3735929465">Metadata_Reference</a></pre>
+
+
+</td>
+
+<td>
+<p>Reference to metadata on which this functor operates.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link6">Metadata operations.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a href = "#metadata_type3735929937">metadata_type</a>
+ <b>operator</b>()
+ () <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Creates a metadata object.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>bool</b>
+ <b>operator</b>()
+ (<a href = "#metadata_reference3735929497">metadata_reference</a> r_data) <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Decides whether a metadata object should be moved to the front of the list.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+
+
+</body>
+
+</html>
+
+
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/data_enabled_ms_tag.html b/libstdc++-v3/docs/html/ext/pb_assoc/data_enabled_ms_tag.html
new file mode 100644
index 0000000..7ae1ac0
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/data_enabled_ms_tag.html
@@ -0,0 +1,41 @@
+
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+
+
+<html>
+<head>
+<title>data_enabled_ms_tag Interface
+</title>
+
+</head>
+
+<body>
+<h1>
+<tt>data_enabled_ms_tag
+</tt>
+
+ Interface
+
+
+</h1>
+
+<p>Mapping-semantics tag indicating that the container objects maps each key to some datum.
+</p>
+
+<ol>
+<li>
+<a href = "../../../../include/ext/pb_assoc/ms_trait.hpp"><tt>ms_trait.hpp</tt>
+</a>
+
+</li>
+
+</ol>
+
+
+
+
+</body>
+
+</html>
+
+
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/design.html b/libstdc++-v3/docs/html/ext/pb_assoc/design.html
new file mode 100644
index 0000000..4eace5f
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/design.html
@@ -0,0 +1,23 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+<html>
+ <head>
+ <title>Design</title>
+ <meta name="GENERATOR" content="Microsoft Visual Studio .NET 7.1">
+ <meta name="vs_targetSchema" content="http://schemas.microsoft.com/intellisense/ie5">
+ </head>
+<body bgcolor = "white">
+<h1>Design</h1>
+
+<ol>
+ <li> <a href = "overview.html">Overview</a> describes an overview.</li>
+ <li> <a href = "concepts.html">Concepts</a> describes some concepts. </li>
+ <li> <a href = "ds_gen.html">Data-Structure Genericity</a> discusses generic manipulation of containers based on different underlying data-structures.</li>
+ <li> <a href = "ms_gen.html">Mapping-Semantic Genericity</a> discusses generic manipulation of containers with different mapping semantics.</li>
+ <li> <a href = "hash_based_containers.html">Hash-Based Containers</a> describes the design and policies of hash-based containers.</li>
+ <li> <a href = "tree_based_containers.html">Tree-Based Containers</a> describes the design and policies of tree-based containers.</li>
+ <li> <a href = "lu_based_containers.html">List-Based Containers</a> describes the design and policies of list-based containers with update policies.</li>
+</ol>
+
+
+ </body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/different_underlying_dss.jpg b/libstdc++-v3/docs/html/ext/pb_assoc/different_underlying_dss.jpg
new file mode 100644
index 0000000..2ddd257
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/different_underlying_dss.jpg
Binary files differ
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/direct_mask_range_hashing.html b/libstdc++-v3/docs/html/ext/pb_assoc/direct_mask_range_hashing.html
new file mode 100644
index 0000000..f1915c3
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/direct_mask_range_hashing.html
@@ -0,0 +1,251 @@
+
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+
+
+<html>
+<head>
+<title>direct_mask_range_hashing Interface
+</title>
+
+</head>
+
+<body>
+<h1>
+<tt>direct_mask_range_hashing
+</tt>
+
+ Interface
+
+
+</h1>
+
+<p>A mask range-hashing class (uses a bit-mask).
+</p>
+
+<ol>
+<li>
+<a href = "../../../../include/ext/pb_assoc/hash_policy.hpp"><tt>hash_policy.hpp</tt>
+</a>
+
+</li>
+
+<li>
+<a href = "#link1">Template parameters.
+</a>
+
+</li>
+
+<li>
+Public Types and Constants:
+
+
+<ol>
+<li>
+<a href = "#link2">General definitions.
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+<li>
+Public Methods:
+
+
+<ol>
+<li>
+<a href = "#link3">Constructors, destructor, and related.
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+<li>
+Protected Methods:
+
+
+<ol>
+<li>
+<a href = "#link4">Notification methods.
+</a>
+
+</li>
+
+<li>
+<a href = "#link5">Operators.
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+</ol>
+
+
+<h2>
+<a name = "link1">Template parameters.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "20%" ALIGN = "left"><b>Parameter</b></TD><TD Width = "50%" ALIGN = "left"><b>Description</b></TD><TD Width = "30%" ALIGN = "left"><b>Default Value</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "Size_Type3735929483">Size_Type</a></pre>
+
+
+</td>
+
+<td>
+<p>Size type.</p>
+
+
+</td>
+
+<td>
+size_t
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link2">General definitions.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "30%" ALIGN = "left"><b>Type</b></TD><TD Width = "55%" ALIGN = "left"><b>Definition</b></TD><TD Width = "15%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "size_type3735929547">size_type</a></pre>
+
+
+</td>
+
+<td>
+<pre><a href = "#Size_Type3735929483">Size_Type</a></pre>
+
+
+</td>
+
+<td>
+<p>Size type.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link3">Constructors, destructor, and related.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>void</b>
+ swap
+ (<font color = "olive">direct_mask_range_hashing</font> &amp;r_other)</pre>
+
+
+</td>
+
+<td>
+<p>Swaps content.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link4">Notification methods.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>void</b>
+ notify_resized
+ (<a href = "#size_type3735929547">size_type</a> size)</pre>
+
+
+</td>
+
+<td>
+<p>Notifies the policy object that the container's size has changed to <font color = "#666666"><tt>size</tt></font>.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link5">Operators.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>inline</b> <a href = "#size_type3735929547">size_type</a>
+ <b>operator</b>()
+ (<a href = "#size_type3735929547">size_type</a> hash) <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Transforms the hash value <font color = "#666666"><tt>hash</tt></font> into a ranged-hash value (using a bit-mask).</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+
+
+</body>
+
+</html>
+
+
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/direct_mod_range_hashing.html b/libstdc++-v3/docs/html/ext/pb_assoc/direct_mod_range_hashing.html
new file mode 100644
index 0000000..b9096cc
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/direct_mod_range_hashing.html
@@ -0,0 +1,228 @@
+
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+
+
+<html>
+<head>
+<title>direct_mod_range_hashing Interface
+</title>
+
+</head>
+
+<body>
+<h1>
+<tt>direct_mod_range_hashing
+</tt>
+
+ Interface
+
+
+</h1>
+
+<p>A mod range-hashing class (uses the modulo function).
+</p>
+
+<ol>
+<li>
+<a href = "../../../../include/ext/pb_assoc/hash_policy.hpp"><tt>hash_policy.hpp</tt>
+</a>
+
+</li>
+
+<li>
+<a href = "#link1">Template parameters.
+</a>
+
+</li>
+
+<li>
+Public Types and Constants:
+
+
+<ol>
+<li>
+<a href = "#link2">General definitions.
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+<li>
+Public Methods:
+
+
+<ol>
+<li>
+<a href = "#link3">Constructors, destructor, and related.
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+<li>
+Protected Methods:
+
+
+<ol>
+<li>
+<a href = "#link4">Notification methods.
+</a>
+
+</li>
+
+<li>
+<a href = "#link5">Operators.
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+</ol>
+
+
+<h2>
+<a name = "link1">Template parameters.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "20%" ALIGN = "left"><b>Parameter</b></TD><TD Width = "50%" ALIGN = "left"><b>Description</b></TD><TD Width = "30%" ALIGN = "left"><b>Default Value</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "Size_Type3735929483">Size_Type</a></pre>
+
+
+</td>
+
+<td>
+<p>Size type.</p>
+
+
+</td>
+
+<td>
+size_t
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link2">General definitions.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "30%" ALIGN = "left"><b>Type</b></TD><TD Width = "55%" ALIGN = "left"><b>Definition</b></TD><TD Width = "15%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "size_type3735929547">size_type</a></pre>
+
+
+</td>
+
+<td>
+<pre><a href = "#Size_Type3735929483">Size_Type</a></pre>
+
+
+</td>
+
+<td>
+<p>Size type.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link3">Constructors, destructor, and related.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>void</b>
+ swap
+ (<font color = "olive">direct_mod_range_hashing</font> &amp;r_other)</pre>
+
+
+</td>
+
+<td>
+<p>Swaps content.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link4">Notification methods.
+</a>
+
+</h2>
+
+<h2>
+<a name = "link5">Operators.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>inline</b> <a href = "#size_type3735929547">size_type</a>
+ <b>operator</b>()
+ (<a href = "#size_type3735929547">size_type</a> hash) <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Transforms the hash value <font color = "#666666"><tt>hash</tt></font> into a ranged-hash value (using a modulo operation).</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+
+
+</body>
+
+</html>
+
+
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/disclaimer.html b/libstdc++-v3/docs/html/ext/pb_assoc/disclaimer.html
new file mode 100644
index 0000000..c5dcb86
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/disclaimer.html
@@ -0,0 +1,25 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+<html>
+<head>
+<title>Disclaimer and Copyright</title>
+<meta name="GENERATOR" content="Microsoft Visual Studio .NET 7.1">
+<meta name="vs_targetSchema" content="http://schemas.microsoft.com/intellisense/ie5">
+</head>
+<body bgcolor = "white">
+
+<h2>Disclaimer and Copyright</h2>
+
+<p>
+Revised 16 February, 2004
+</p>
+&copy; Copyright Ami Tavory and Vladimir Dreizin, IBM-HRL, 2004, and Benjamin Kosnik, Red Hat, 2004.
+<P>
+Permission to use, copy, modify, sell, and distribute this software is hereby granted without fee, provided that the above copyright notice appears in all copies, and that both that copyright notice and this permission notice appear in supporting documentation.
+</p>
+<P>
+None of the above authors, nor IBM Haifa Research Laboratories, Red Hat, or both, make any representation about the suitability of this software for any purpose. It is provided "as is" without express or implied warranty.
+</p>
+
+
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/ds_gen.html b/libstdc++-v3/docs/html/ext/pb_assoc/ds_gen.html
new file mode 100644
index 0000000..d7cc0aa
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/ds_gen.html
@@ -0,0 +1,368 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+<html>
+ <head>
+ <title>Data-Structure Genericity</title>
+ <meta name="GENERATOR" content="Microsoft Visual Studio .NET 7.1">
+ <meta name="vs_targetSchema" content="http://schemas.microsoft.com/intellisense/ie5">
+ </head>
+<body bgcolor = "white">
+<h1>Data-Structure Genericity</h1>
+
+<p>
+ This section describes genericity over different underlying data-structures. It is organized as follows.
+</p>
+<ol>
+ <li><a href = "#problem">The Basic Problem</a></li>
+ <li><a href = "#ds_hierarchy">Container Hierarchy</a></li>
+ <li><a href = "#ds_traits">Data-Structure Tags and Traits</a></li>
+ <li><a href = "#find_range">Find-Type and Range-Type Methods and Iterators</a></li>
+</ol>
+
+<h2><a name = "problem">The Basic Problem</a></h2>
+
+<p>
+ The design attempts to address the following problem. When writing a function manipulating a generic container object, what is the behaviour of the object? <i>E.g.</i>, suppose one writes
+</p>
+<pre>
+<b>template</b>&lt;
+ <b>class</b> Cntnr&gt;
+<b>void</b> some_op_sequence
+ (Cntnr &r_cntnr)
+{
+ ...
+}
+</pre>
+then one needs to address the following questions in the body
+of <tt>some_op_sequence</tt>:
+<ol>
+ <li> Which types and methods does <tt>Cntnr</tt> support? Containers based on hash tables can be queries for the hash-functor type and object; this is meaningless for tree-based containers. Containers based on trees can be split, joined, or can erase iterators and return the following iterator; this cannot be done by hash-based containers. </li>
+ <li>
+ What are the guarantees of <tt>Cntnr</tt>? A container based on a probing hash-table invalidates all iterators when it is modified; this is not the case for containers based on node-based trees. Containers based on a node-based tree can be split or joined without exceptions; this is not the case for containers based on vector-based trees.
+ </li>
+ <li> How does the container maintain its elements? containers based on splay trees or lists with update policies "cache" "frequently accessed" elements; containers based on most other underlying data-structures do not.</li>
+</ol>
+
+<h2><a name = "ds_hierarchy">Container Hierarchy</a></h2>
+
+<p>
+ Figure
+<a href = "#cd">Class hierarchy</a>
+ shows the container hierarchy.
+</p>
+<ol>
+ <li>
+<a href = "basic_assoc_cntnr.html"><tt>basic_assoc_cntnr</tt></a>
+contains types and methods shared by all associative containers, <i>e.g.</i>, the type <tt>allocator</tt> and the method <tt>find</tt>.
+ </li>
+ <li><a href = "basic_assoc_cntnr.html"><tt>basic_hash_assoc_cntnr</tt></a> subclasses
+<a href = "basic_assoc_cntnr.html"><tt>basic_assoc_cntnr</tt></a>, and contains
+types and methods shared by all hash-based containers, <i>e.g.</i>, the type <tt>hash_fn</tt>.
+ </li>
+ <ol>
+ <li>
+<a href = "cc_hash_assoc_cntnr.html"><tt>cc_hash_assoc_cntnr</tt></a>
+and
+<a href = "gp_hash_assoc_cntnr.html"><tt>gp_hash_assoc_cntnr</tt></a>
+each subclass
+<a href = "basic_hash_assoc_cntnr.html"><tt>basic_hash_assoc_cntnr</tt></a>, and encapsulate collision-chaining and (general) probing hash tables, respectively. These two types of hash tables have somewhat different policies and methods (<i>i.e.</i>, constructors and policy-access methods).
+ </li>
+ </ol>
+ <li>
+<a href = "tree_assoc_cntnr.html"><tt>tree_assoc_cntnr</tt></a>
+subclasses one of
+<a href = "basic_tree_assoc_cntnr.html"><tt>basic_tree_assoc_cntnr</tt></a> which
+subclasses
+<a href = "basic_assoc_cntnr.html"><tt>basic_assoc_cntnr</tt></a>.
+<a href = "tree_assoc_cntnr.html"><tt>tree_assoc_cntnr</tt></a>
+ encapsulates a tree-based container, and is parameterized by which underlying data-structure to use (<i>e.g.</i>, a red-black tree);
+<a href = "basic_assoc_cntnr.html"><tt>basic_assoc_cntnr</tt></a>.
+is specialized to the capabilities of the underlying structure.
+<a href = "tree_assoc_cntnr.html"><tt>tree_assoc_cntnr</tt></a> contains some additional methods over
+<a href = "basic_assoc_cntnr.html"><tt>basic_assoc_cntnr</tt></a>,
+<i>e.g.</i>, split and join methods.
+ </li>
+ <li>
+<a href = "lu_assoc_cntnr.html"><tt>lu_assoc_cntnr</tt></a>
+subclasses
+<a href = "basic_assoc_cntnr.html"><tt>basic_assoc_cntnr</tt></a>,
+and encapsulates a list with update policies.
+ </li>
+</ol>
+
+<p>
+ The hierarchy is composed naturally, such that each container inherits
+all types and methods from its base. <a href = "#ds_traits">Data-Structure Tags and Traits</a> discusses how to query which types and methods each container supports.
+</p>
+
+
+
+<h2><a name = "ds_traits">Data-Structure Tags and Traits</a></h2>
+
+<p>
+ <tt>pb_assoc</tt> contains a tag and traits mechanism similar to that of the STL's iterators.
+</p>
+
+<p>
+ <tt>pb_assoc</tt> contains a tag hierarchy corresponding to the hierarchy
+in Figure
+<a href = "#cd">Class hierarchy</a>.
+The tag hierarchy is shown in Figure
+<a href = "#ds_tag_cd">Data-structure tag class hierarchy</a>.
+</p>
+
+<h6 align = "center">
+<a name = "cd">
+<img src = "ds_tag_cd.jpg" width = "70%" alt = "no image">
+</h6>
+</a>
+<h6 align = "center">
+Data-structure tag class hierarchy.
+</h6>
+
+<p>
+ <a href = "basic_assoc_cntnr.html"><tt>basic_assoc_cntnr</tt></a> publicly defines
+<tt>ds_category</tt> as one of the classes in Figure
+.
+Given any container <tt>Cntnr</tt>, the tag of the underlying data-structure can be found via <tt><b>typename</b> Cntnr::ds_category</tt>.
+</p>
+
+<p>
+ Additionally, a traits mechanism can be used to query a container type for its attributes. Given any container <tt>Cntnr</tt>, then
+<tt><a href = "ds_traits.html">ds_traits</a>&lt;Cntnr&gt;</tt>
+is a traits class identifying the properties of the container.
+</p>
+
+<p>
+ To find if a container can throw when a key is erased (which is true for vector-based trees, for example), one can use
+</p>
+<a href = "ds_traits.html"><tt>ds_traits</tt></a><tt>&lt;Cntnr&gt;::erase_can_throw</tt>,
+for example.
+
+<p>
+ Some of the definitions in
+<a href = "ds_traits.html"><tt>ds_traits</tt></a>
+are dependent on other definitions. <i>E.g.</i>, if
+<a href = "ds_traits.html"><tt>ds_traits</tt></a><tt>&lt;Cntnr&gt;::split_join</tt>
+is <tt><b>true</b></tt> (which is the case for containers based on trees),
+then
+<a href = "ds_traits.html"><tt>ds_traits</tt></a><tt>&lt;Cntnr&gt;::split_join_can_throw</tt>
+indicates whether splits or joins can throw exceptions (which is true for vector-based trees); otherwise
+<a href = "ds_traits.html"><tt>ds_traits</tt></a><tt>&lt;Cntnr&gt;::split_join_can_throw</tt>
+will yield a compilation error. (This is somewhat similar to a compile-time
+version of the COM model
+[<a href = "references.html#mscom">mscom</a>]).
+
+
+<h2><a name = "find_range">Find-Type and Range-Type Methods and Iterators</a></h2>
+
+<p>
+ <tt>pb_assoc</tt> differentiates between two types of methods: find-type methods, and range-type methods. For example, <tt>find</tt> is a find-type method, since a container object searches for an element with a given key; <tt>insert</tt> is a find-type method, since, by STL convention, a container object returns an iterator corresponding to an element with a given key; <tt>begin</tt> and <tt>end</tt> are range-type methods, since they are not used to find a specific element, but rather to go over all elements in a container object.
+</p>
+
+<p>
+ Correspondingly, containers in <tt>pb_assoc</tt> define two families of iterators. <tt>const_find_iterator</tt> and <tt>find_iterator</tt> are the iterator types returned by find-type methods; <tt>const_iterator</tt> and <tt>iterator</tt> are the iterator types returned by range-type methods.
+</p>
+
+<p>
+ The relationship between these iterator types varies between container types. In a tree-based container, for example, <tt>const_find_iterator</tt> and <tt>const_iterator</tt> are synonymous, and <tt>find_iterator</tt> and <tt>iterator</tt> are synonymous; in a hash-based container, for example, this is not the case. Futhermore, find-type iterators in a hash-based container lack movement operators, such as
+ <tt><b>operator++</b></tt>.
+ All containers, however, maintain the invariants shown in Figure
+
+.
+</p>
+
+
+<p>
+ This distinction between find-type and range-type iterators and methods, while complicating the interface, has several advantages:
+</p>
+
+<h3>Iterators in unordered container types</h3>
+
+<p>
+ Given an unordered container type, <i>e.g.</i>, a hash-based container, it makes no sense to move an iterator returned by a find-type method.
+Let <tt>cntnr</tt> be an associative-container object, and
+consider:
+</p>
+
+<pre>
+std::for_each(m.find(1), m.find(5), foo);
+</pre>
+
+<p>
+which applies <tt>foo</tt> to all elements in <tt>m</tt>
+between <tt>1</tt> and <tt>5</tt>.
+</p>
+
+<p>If <tt>cntnr</tt> is a
+tree-based container object, then an in-order walk will apply <tt>foo</tt>
+to the relevant elements, <i>e.g.</i>, as in Figure
+<a href = "#range_it_in_hts">Range iteration in different data-structures</a>
+-A. If <tt>m</tt> is a
+hash-based container, then the order of elements between any two
+elements is undefined (and probably time-varying); there is no
+guarantee that the elements traversed will coincide with the
+<i>logical</i> elements between 1 and 5, <i>e.g.</i>, as in
+Figure <a href = "#range_it_in_hts">Range iteration in different data-structures</a>-B.
+</p>
+
+<p>
+The application of a
+range function <i>e.g.</i>, <tt>for_each</tt>, to a
+pair of hash-based container's iterators is possibly sensical only
+if the iterators are those returned by <tt>begin</tt> and <tt>end</tt>,
+respectively. Therefore, the iterator returned by
+<tt>m</tt>'s <tt>find</tt> method should be immovable.
+</p>
+
+<p>
+ Another point also indicates that hash-based containers'
+find-type iterators and range-type iterators should be distinct.
+Consider Figure
+<a href = "#find_its_in_hash_tables">
+Find-type iterators in hash tables</a>-A.
+An
+(immovable) find-type iterator, designed only to access an
+element, requires at most a single pointer to the element's link.
+Conversely, an iterator designed for range operations
+requires some more information <i>e.g.</i>, the bucket number),
+since a cross-list traversal might be necessary. Alternatively,
+the lists might be linked, forming a monolithic total-element
+list, as in Figure
+<a href = "#find_its_in_hash_tables">
+Find-type iterators in hash tables</a>-B (this seems
+similar to the Dinkumware design
+[<a href = "references.html#dinkumware_stl">dinkumware_stl</a>]). This,
+however, complicates the hash-table's operations.
+
+<h6 align = "center">
+<a name = "range_it_in_hts">
+<img src = "find_iterators_range_ops_1.jpg" width = "70%" alt = "no image">
+</a>
+</h6>
+<h6 align = "center">
+Range iteration in different data-structures.
+</h6>
+
+
+<h6 align = "center">
+<a name = "find_its_in_hash_tables">
+<img src = "find_iterators_range_ops_2.jpg" width = "70%" alt = "no image">
+</a>
+</h6>
+<h6 align = "center">
+Find-type iterators in hash tables.
+</h6>
+
+<p>
+ As a consequence of this design,
+</p>
+
+<pre>
+std::for_each(m.find(1), m.find(5), foo);
+</pre>
+
+<p>
+ will compile for tree-based containers, but will not compile
+for hash-tables or other types. The returned type of <tt>find</tt>
+is a find-type iterator. For tree-based containers, this is synonymous
+with a range-type iterator, and therefore supports <tt><b>operator</b>++</tt>;
+for other types of containers, a find-type iterator lacks <tt><b>operator</b>++</tt>.
+</p>
+
+<h3>Invalidation Guarantees</h3>
+
+<p>
+ Consider the following snippet:
+</p>
+
+<pre>
+it = c.find(3);
+
+c.erase(5);
+</pre>
+
+<p>
+ Following the call to <tt>erase</tt>, what is the validity
+of <tt>it</tt>: can it be dereferenced? can it be incremented?
+</p>
+
+<p>
+ The answer depends on the underlying data-structure of the container.
+Figure
+<a href = "#invalidation_guarantee_erase">Effect of erase in different underlying data-structures</a>
+shows three cases: A1 and A2 show a red-black tree;
+B1 and B2 show an ordered-vector tree; C1 and C2
+show a collision-chaining hash table.
+</p>
+
+<h6 align = "center">
+<a name = "invalidation_guarantee_erase">
+<img src = "invalidation_guarantee_erase.jpg" width = "70%" alt = "no image">
+</h6>
+</a>
+<h6 align = "center">
+Effect of erase in different underlying data-structures.
+</h6>
+
+
+<ol>
+ <li>
+ `Erasing 5 from A1 yields A2. Clearly, an iterator to 3
+ can be dereferenced and incremented.
+ </li>
+ <li>
+ Erasing 5 from B1 yields B2. Clearly, an iterator to 3 is
+ not valid at all.
+ </li>
+ <li>
+ Erasing 5 from C1 yields C2. Here the situation is more complicated.
+On the one hand, incrementing <tt>it</tt> can be undefined. On the other
+hand, there is no problem in dereferencing <tt>it</tt>. In
+classic STL, it is not possible to express whether <tt>it</tt>
+is valid or not.
+ </li>
+</ol>
+
+<p>
+ Thus again, the iterator concept seems overloaded. Distinguishing
+between find and range types allows fine-grained invalidation guarantees.
+<a href = #invalidation_guarantee_cd">Invalidation guarantees class hierarchy</a>
+shows tags corresponding to different types of invalidation guarantees.
+</p>
+
+<h6 align = "center">
+<a name = "invalidation_guarantee_cd">
+<img src = "invalidation_guarantee_cd.jpg" width = "70%" alt = "no image">
+</h6>
+</a>
+<h6 align = "center">
+Invalidation guarantees class hierarchy.
+</h6>
+
+<ol>
+ <li> <a href = "basic_invalidation_guarantee.html"><tt>basic_invalidation_guarantee</tt></a> corresponds to a basic guarantee that a find-type iterator, a found pointer, or a found reference, remains valid as long as the container object is not modified.
+ </li>
+ <li> <a href = "find_invalidation_guarantee.html"><tt>find_invalidation_guarantee</tt></a> corresponds to a guarantee that a find-type iterator, a found pointer, or a found reference, remains valid even if the containter object is modified.
+ </li>
+ <li> <a href = "range_invalidation_guarantee.html"><tt>range_invalidation_guarantee</tt></a> corresponds to a guarantee that a range-type iterator remains valid even if the containter object is modified.
+ </li>
+</ol>
+
+
+<p>
+ To find the invalidation guarantee of a container, one can use
+</p>
+<pre>
+<b>typename</b> <a href = "ds_traits.html">ds_traits</a>&lt;Cntnr&gt;::invalidation_guarantee
+</pre>
+
+<p>
+ which is one of the classes in Figure
+<a href = #invalidation_guarantee_cd">Invalidation guarantees class hierarchy</a>.
+</p>
+
+
+
+</body>
+
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/ds_tag_cd.jpg b/libstdc++-v3/docs/html/ext/pb_assoc/ds_tag_cd.jpg
new file mode 100644
index 0000000..0526f86
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/ds_tag_cd.jpg
Binary files differ
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/ds_traits.html b/libstdc++-v3/docs/html/ext/pb_assoc/ds_traits.html
new file mode 100644
index 0000000..c646af2
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/ds_traits.html
@@ -0,0 +1,41 @@
+
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+
+
+<html>
+<head>
+<title>ds_traits Interface
+</title>
+
+</head>
+
+<body>
+<h1>
+<tt>ds_traits
+</tt>
+
+ Interface
+
+
+</h1>
+
+<p>Signifies a basic invalidation guarantee that any iterator, pointer, or reference to a container object's mapped value type is valid as long as the container is not modified.
+</p>
+
+<ol>
+<li>
+<a href = "../../../../include/ext/pb_assoc/ds_trait.hpp"><tt>ds_trait.hpp</tt>
+</a>
+
+</li>
+
+</ol>
+
+
+
+
+</body>
+
+</html>
+
+
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/embedded_lists_1.jpg b/libstdc++-v3/docs/html/ext/pb_assoc/embedded_lists_1.jpg
new file mode 100644
index 0000000..0d6569a
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/embedded_lists_1.jpg
Binary files differ
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/embedded_lists_2.jpg b/libstdc++-v3/docs/html/ext/pb_assoc/embedded_lists_2.jpg
new file mode 100644
index 0000000..d6e4aa1
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/embedded_lists_2.jpg
Binary files differ
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/examples.html b/libstdc++-v3/docs/html/ext/pb_assoc/examples.html
new file mode 100644
index 0000000..af20aad
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/examples.html
@@ -0,0 +1,185 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+<html>
+<head>
+<title>Examples</title>
+<meta name="GENERATOR" content="Microsoft Visual Studio .NET 7.1">
+<meta name="vs_targetSchema" content="http://schemas.microsoft.com/intellisense/ie5">
+</head>
+<body bgcolor = "white">
+<h1>Examples</h1>
+
+<ol>
+ <li><a href = "#basic_usage">Basic use</a></li>
+ <li><a href = "#generics">Generics</a></li>
+ <li><a href = "#hash_based">Hash-Based Containers</a></li>
+ <li><a href = "#tree_based">Tree-Based Containers</a></li>
+</ol>
+
+<h2><a name = "basic_usage">Basic Use</a></h2>
+
+<ol>
+ <li><a href = "../../../../testsuite/ext/pb_assoc/example/basic_map.cc"><tt>basic_map.cc</tt></a>- Basic use of &quot;maps&quot;.</li>
+ <li><a href = "../../../../testsuite/ext/pb_assoc/example/basic_set.cc"><tt>basic_set.cc</tt></a>- Basic use of &quot;sets&quot;.
+See
+<a href = "ms_gen.html#ds_policy">Mapping Semantics::Data Types as a Policy</a>.
+ </li>
+ <li><a href = "../../../../testsuite/ext/pb_assoc/example/basic_multimap.cc"><tt>basic_multimap.cc</tt></a>- Basic use of &quot;multimaps&quot;.
+See
+ <a href = "ms_gen.html#ds_policy">Mapping Semantics::Data Types as a Policy</a>.
+ </li>
+ <li><a href = "../../../../testsuite/ext/pb_assoc/example/erase_if.cc"><tt>erase_if.cc</tt></a>- Conditionally
+erasing values from a container object.
+See
+<a href = "motivation.html#methods">Motivation::Choice of Methods</a>.
+ </li>
+</ol>
+
+
+
+<h2><a name = "generics">Generics</a></h2>
+
+<ol>
+ <li><a href = "../../../../testsuite/ext/pb_assoc/example/ds_traits.cc"><tt>ds_traits.cc</tt></a>-
+Using
+<a href = "ds_traits.html"><tt>ds_traits</tt></a> to query about underlying
+data-structure behaviour.
+See
+<a href = "ds_gen.html#ds_traits">Data-Structure Genericity::Data-Structure Tags and Traits</a>.
+ </li>
+ <li> <a href = "../../../../testsuite/ext/pb_assoc/example/mapping_level.cc"><tt>mapping_level.cc</tt></a>-
+Rebinding a compound associative-container to different mapping levels.
+See
+<a href = "ms_gen.html#mapping_level">Mapping-Semantics::Mapping Levels</a>.
+ </li>
+ <li> <a href = "../../../../testsuite/ext/pb_assoc/example/ms_traits.cpp"><tt>ms_traits.cpp</tt></a>-
+Using <a href = "ms_traits.html"><tt>ms_traits</tt></a>
+to query about mapping semantics.
+See
+<a href = "ms_gen.html#ms_traits">Mapping-Semantics::Tags and Traits</a>.
+ </li>
+ <li><a href = "../../../../testsuite/ext/pb_assoc/example/cc_ht_extract_key.cc"><tt>cc_ht_extract_key.cc</tt></a>-
+ Extracting the key from different types.
+ </li>
+</ol>
+
+
+<h2><a name = "hash_based">Hash-Based Containers</a></h2>
+
+<p>
+ See
+<a href = "hash_based_containers.html">Hash-Based Containers</a>.
+</p>
+
+<h3>General</h3>
+
+<ol>
+ <li>
+ <a href = "../../../../testsuite/ext/pb_assoc/example/hash_bad_find.cc"><tt>hash_bad_find.cc</tt></a>-
+ A non-compiling example showing wrong use of finding keys in hash-based
+ containers.
+ See
+ <a href = "ds_gen.html#find_range">Data-Structure Genericity::Find-Type and Range-Type Methods and Iterators</a>.
+ </li>
+</ol>
+
+
+<h3>Resize-Related</h3>
+
+<p>See
+ <a href = "../../../../testsuite/ext/pb_assoc/example/hash_based_containers.html#resize_policies">Hash-Based Containers::Resize Policies</a>.
+</p>
+
+<ol>
+ <li>
+ <a href = "../../../../testsuite/ext/pb_assoc/example/hash_initial_size.cc"><tt>hash_initial_size.cc</tt></a>-
+ Setting the initial size of a hash-based container object.
+ </li>
+ <li>
+ <a href = "../../../../testsuite/ext/pb_assoc/example/hash_bad_resize.cc"><tt>hash_bad_resize.cc</tt></a>-
+ A non-compiling example showing how not to resize a hash-based container object.
+ </li>
+ <li>
+ <a href = "../../../../testsuite/ext/pb_assoc/example/hash_resize.cc"><tt>hash_resize.cc</tt></a>-
+ Resizing the size of a hash-based container object.
+ </li>
+ <li><a href = "../../../../testsuite/ext/pb_assoc/example/hash_illegal_resize.cc"><tt>hash_illegal_resize.cc</tt></a>-
+ Showing an illegal resize of a hash-based container object.
+ </li>
+ <li>
+ <a href = "../../../../testsuite/ext/pb_assoc/example/hash_load_set_change.cc"><tt>hash_load_set_change.cc</tt></a>-
+ Changing the load factors of a hash-based container object.
+ </li>
+</ol>
+
+
+<h3>Hash-Related</h3>
+
+<p>See
+ <a href = "../../../../testsuite/ext/pb_assoc/example/hash_based_containers.html#hash_policies">Hash-Based Containers::Hash Policies</a>.
+</p>
+
+<ol>
+ <li>
+ <a href = "../../../../testsuite/ext/pb_assoc/example/hash_mod.cc"><tt>hash_mod.cc</tt></a>-
+Using a modulo range-hashing function.
+ </li>
+ <li>
+ <a href = "../../../../testsuite/ext/pb_assoc/example/store_hash.cc"><tt>store_hash.cc</tt></a>-
+ Storing the hash value along with each key.
+ </li>
+ <li>
+ <a href = "../../../../testsuite/ext/pb_assoc/example/shift_mask.cc"><tt>shift_mask.cc</tt></a>-
+ Writing a range-hashing functor.
+ </li>
+ <li><a href = "../../../../testsuite/ext/pb_assoc/example/ranged_hash.cc"><tt>ranged_hash.cc</tt></a>-
+ Writing
+ a ranged-hash functor.</li>
+</ol>
+
+
+
+
+
+<h2><a name = "tree_based">Tree-Based Containers</a></h2>
+
+<p>
+ See
+<a href = "tree_based_containers.html">Tree-Based Containers</a>.
+</p>
+
+<h3>Node-Invariatns</h3>
+
+<p>
+ See
+<a href = "tree_based_containers.html#invariants">Tree-Based Containers::Node Invariants</a>.
+</p>
+
+<ol>
+ <li><a href="../../../../testsuite/ext/pb_assoc/example/tree_order_statistics.cc"><tt>tree_order_statistics.cc</tt></a>-
+Using trees for order statistics.
+ </li>
+ <li><a href="../../../../testsuite/ext/pb_assoc/example/tree_intervals.cc"><tt>tree_intervals.cc</tt></a>- Augmenting an
+<a href = "ov_tree_set.html"><tt>ov_tree_set</tt></a>
+to support operations on line intervals.
+ </li>
+</ol>
+
+<h3>Split and Join</h3>
+
+<p>
+ See
+<a href = "tree_based_containers.html#add_methods">Tree-Based Containers::Additional Types and Methods</a>.
+</p>
+
+<ol>
+ <li><a href="../../../../testsuite/ext/pb_assoc/example/tree_join.cc"><tt>tree_join.cc</tt></a>- Joining
+two tree-based container objects.
+ </li>
+ <li><a href="../../../../testsuite/ext/pb_assoc/example/tree_split.cc"><tt>tree_split.cc</tt></a>- Splitting
+a tree-based container object.
+ </li>
+ <li><a href="../../../../testsuite/ext/pb_assoc/example/tree_order_statistics_join.cc"><tt>tree_order_statistics_join.cc</tt></a>- Order statistics while joining two tree-based container objects.
+</ol>
+
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/exception_guarantees_specifics.html b/libstdc++-v3/docs/html/ext/pb_assoc/exception_guarantees_specifics.html
new file mode 100644
index 0000000..48f12bc
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/exception_guarantees_specifics.html
@@ -0,0 +1,31 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+
+<html>
+<head>
+ <title>Exception Guarantee Specifics</title>
+</head>
+<body bgcolor = "white">
+<h1>Exception Guarantee Specifics</h1>
+The following represent exception guaratee specifics, subject to the <a href="component_requirements.html#exception_requirements">component exception-requirements</a>.
+<ol>
+ <li> <a name="basic_guarantee">No</a> resources are leaked in the face of exceptions. In particular, this means:
+ <ol>
+ <li>By the time a container's destructor completes:
+ <ol>
+ <li>It has returned all memory it has allocated to the appropriate deallocation function.</li>
+ <li>The destructor has been called for all objects constructed by the container.</li>
+ </ol>
+ <li>Algorithms destroy all temporary objects and deallocate all temporary memory even if the algorithm does not complete due to an exception.</li>
+ <li>Algorithms which construct objects either complete successfully or destroy any objects they have constructed at the time of the exception.</li>
+ <li>Algorithms which destruct objects always succeed.</li>
+ <li>Containers continue to fulfill all of their requirements, even after an exception occurs during a mutating function. For example, they will never give an inaccurate report of its size, or fail to meet performance requirements because of some thrown exception.</li>
+ </ol>
+ </li>
+ <li> <a name="strong_guarantee">The</a> <i>strong guarantee</i>: If an operation on a container fails due to an exception, then, semantically, the operation is a no-op applied to the container.</li>
+ <li> <a name="cannot_throw_guarantee">The</a> operation cannot throw an exception.</li>
+</ol>
+(The phrasing of the above is based on <a href="references.html#abrahams97exception">[abrahams97exception]</a>.)
+
+
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/find_invalidation_guarantee.html b/libstdc++-v3/docs/html/ext/pb_assoc/find_invalidation_guarantee.html
new file mode 100644
index 0000000..38d9447
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/find_invalidation_guarantee.html
@@ -0,0 +1,74 @@
+
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+
+
+<html>
+<head>
+<title>find_invalidation_guarantee Interface
+</title>
+
+</head>
+
+<body>
+<h1>
+<tt>find_invalidation_guarantee
+</tt>
+
+ Interface
+
+
+</h1>
+
+<p>Signifies an invalidation guarantee that includes all those of its base, and additionally, that any find-type iterator, pointer, or reference to a container object's mapped value type is valid as long as its corresponding entry has not be erased, regardless of modifications to the container object.
+</p>
+
+<ol>
+<li>
+<a href = "../../../../include/ext/pb_assoc/ds_trait.hpp"><tt>ds_trait.hpp</tt>
+</a>
+
+</li>
+
+<li>
+<a href = "#link1">Base classes.
+</a>
+
+</li>
+
+</ol>
+
+
+<h2>
+<a name = "link1">Base classes.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "80%" ALIGN = "left"><b>Class</b></TD><TD Width = "20%" ALIGN = "left"><b>Derivation Type</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a href = "basic_invalidation_guarantee.html"><tt>basic_invalidation_guarantee</tt></a></pre>
+
+
+</td>
+
+<td>
+<p>public</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+
+
+</body>
+
+</html>
+
+
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/find_iterators_cd.jpg b/libstdc++-v3/docs/html/ext/pb_assoc/find_iterators_cd.jpg
new file mode 100644
index 0000000..5b0e80d
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/find_iterators_cd.jpg
Binary files differ
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/find_iterators_range_ops_1.jpg b/libstdc++-v3/docs/html/ext/pb_assoc/find_iterators_range_ops_1.jpg
new file mode 100644
index 0000000..6cc788f
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/find_iterators_range_ops_1.jpg
Binary files differ
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/find_iterators_range_ops_2.jpg b/libstdc++-v3/docs/html/ext/pb_assoc/find_iterators_range_ops_2.jpg
new file mode 100644
index 0000000..5e567e4
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/find_iterators_range_ops_2.jpg
Binary files differ
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/generics.html b/libstdc++-v3/docs/html/ext/pb_assoc/generics.html
new file mode 100644
index 0000000..5b7f2fb
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/generics.html
@@ -0,0 +1,25 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+<html>
+<head>
+<title>Generics</title>
+<meta name="GENERATOR" content="Microsoft Visual Studio .NET 7.1">
+<meta name="vs_targetSchema" content="http://schemas.microsoft.com/intellisense/ie5">
+</head>
+<body bgcolor = "white">
+<h1>Generics</h1>
+
+<p>
+ Naturally, the ability to program generically different associative containers, is beneficial.
+The distinction in this library between <a href = "data_type_defs.html">data_type</a>s and
+<a href = "mapped_data_type_defs.html">mapped_data_type</a>s, and between <a href = "value_type_defs.html">value_type</a>s and
+<a href = "mapped_value_type_defs.html">mapped_value_type</a>s, somewhat complicates this.
+</p>
+
+<p>
+ The generic utility classes ease static detection of different associative-container
+types (<i>e.g.</i>, whether they are map or multimap types), and the extraction of data from iterators.
+</p>
+
+
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/gp_hash_assoc_cntnr.html b/libstdc++-v3/docs/html/ext/pb_assoc/gp_hash_assoc_cntnr.html
new file mode 100644
index 0000000..3451380
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/gp_hash_assoc_cntnr.html
@@ -0,0 +1,816 @@
+
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+
+
+<html>
+<head>
+<title>gp_hash_assoc_cntnr Interface
+</title>
+
+</head>
+
+<body>
+<h1>
+<tt>gp_hash_assoc_cntnr
+</tt>
+
+ Interface
+
+
+</h1>
+
+<p>A general-probing hash-based associative container.
+</p>
+
+<ol>
+<li>
+<a href = "../../../../include/ext/pb_assoc/assoc_cntnr.hpp"><tt>assoc_cntnr.hpp</tt>
+</a>
+
+</li>
+
+<li>
+<a href = "#link1">Template parameters.
+</a>
+
+</li>
+
+<li>
+<a href = "#link2">Base classes.
+</a>
+
+</li>
+
+<li>
+Public Types and Constants:
+
+
+<ol>
+<li>
+<a href = "#link3">Policy definitions.
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+<li>
+Public Methods:
+
+
+<ol>
+<li>
+<a href = "#link4">Constructors, destructor, and related.
+</a>
+
+</li>
+
+<li>
+<a href = "#link5">Policy access methods.
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+</ol>
+
+
+<h2>
+<a name = "link1">Template parameters.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "20%" ALIGN = "left"><b>Parameter</b></TD><TD Width = "50%" ALIGN = "left"><b>Description</b></TD><TD Width = "30%" ALIGN = "left"><b>Default Value</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "Key3735928856">Key</a></pre>
+
+
+</td>
+
+<td>
+<p>Key type.</p>
+
+
+</td>
+
+<td>
+-
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "Data3735928937">Data</a></pre>
+
+
+</td>
+
+<td>
+<p>Data type.</p>
+
+
+</td>
+
+<td>
+-
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "Hash_Fn3735929222">Hash_Fn</a></pre>
+
+
+</td>
+
+<td>
+<p>Hash functor.</p>
+
+
+</td>
+
+<td>
+<pre>__gnu_cxx::hash&lt;<a href = "#Key3735928856">Key</a>&gt;</pre>if using gcc;<pre>stdext::hash_value&lt;<a href = "#Key3735928856">Key</a>&gt;</pre>if using Visual C++ .net
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "Eq_Fn3735929016">Eq_Fn</a></pre>
+
+
+</td>
+
+<td>
+<p>Equivalence functor.</p>
+
+
+</td>
+
+<td>
+<pre>std::equal_to&lt;<a href = "#Key3735928856">Key</a>&gt;</pre>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "Comb_Probe_Fn3735929818">Comb_Probe_Fn</a></pre>
+
+
+</td>
+
+<td>
+<p>Combining probe functor.</p>
+
+
+<p>If <a href = "#Hash_Fn3735929222">Hash_Fn</a> is <a href = "null_hash_fn.html"><tt>null_hash_fn</tt></a>, and <a href = "#Probe_Fn3735929338">Probe_Fn</a> is <a href = "comb_probe_fn.html"><tt>comb_probe_fn</tt></a>, then this is the <a href = "concepts.html#concepts_hash_fns">ranged_hash function</a> functor; otherwise, this is the <a href = "concepts.html#concepts_hash_fns">range_hashing function</a> functor;</p>
+
+
+</td>
+
+<td>
+<pre><a href = "direct_mask_range_hashing.html">direct_mask_range_hashing</a>&lt;
+ <a href = "#Allocator3735929488">Allocator</a>&gt;</pre>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "Probe_Fn3735929338">Probe_Fn</a></pre>
+
+
+</td>
+
+<td>
+<p>Probe functor.</p>
+
+
+</td>
+
+<td>
+If <tt><a href = "#comb_hash_fn3735929798">comb_hash_fn</a></tt> is <tt><a href = "direct_mask_range_hashing.html">direct_mask_range_hashing&lt;&gt;</a></tt>, then <pre><a href = "linear_probe_fn.html">linear_probe_fn</a>&lt;
+ <b>typename</b> <a href = "#comb_hash_fn3735929798">comb_hash_fn</a>::size_type&gt;</pre>otherwise, <pre><a href = "quadratic_probe_fn.html">quadratic_probe_fn</a>&lt;
+ <b>typename</b> <a href = "#comb_hash_fn3735929798">comb_hash_fn</a>::size_type&gt;</pre>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "Resize_Policy3735929904">Resize_Policy</a></pre>
+
+
+</td>
+
+<td>
+<p>Resize policy.</p>
+
+
+</td>
+
+<td>
+If <tt><a href = "#comb_hash_fn3735929798">comb_hash_fn</a></tt> is <tt><a href = "direct_mask_range_hashing.html">direct_mask_range_hashing&lt;&gt;</a></tt>, then <pre><a href = "hash_standard_resize_policy.html">hash_standard_resize_policy</a>&lt;
+ <a href = "hash_exponential_size_policy.html">hash_exponential_size_policy</a>&lt;
+ <b>typename</b> <a href = "#comb_hash_fn3735929798">comb_hash_fn</a>::size_type&gt;,
+ <a href = "hash_load_check_resize_trigger.html">hash_load_check_resize_trigger</a>&lt;
+ <b>typename</b> <a href = "#comb_hash_fn3735929798">comb_hash_fn</a>::size_type&gt;,
+ <b>false</b>,
+ <b>typename</b> <a href = "#comb_hash_fn3735929798">comb_hash_fn</a>::size_type&gt;</pre>otherwise, <pre><a href = "hash_standard_resize_policy.html">hash_standard_resize_policy</a>&lt;
+ <a href = "hash_exponential_size_policy.html"><tt>hash_prime_size_policy</tt></a>&lt;
+ <b>typename</b> <a href = "#comb_hash_fn3735929798">comb_hash_fn</a>::size_type&gt;,
+ <a href = "hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>&lt;
+ <b>typename</b> <a href = "#comb_hash_fn3735929798">comb_hash_fn</a>::size_type&gt;,
+ <b>false</b>,
+ <b>typename</b> <a href = "#comb_hash_fn3735929798">comb_hash_fn</a>::size_type&gt;</pre>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "Store_Hash3735929567">Store_Hash</a></pre>
+
+
+</td>
+
+<td>
+<p>Indicates whether the hash value will be stored along with each key.</p>
+
+
+<p>If <tt><a href = "#hash_fn3735929286">hash_fn</a></tt> is <tt><a href = "null_hash_fn.html">null_hash_fn</a></tt>, then the container will not compile if this value is <tt><b>true</b></tt></p>
+
+
+</td>
+
+<td>
+<pre><tt><b>false</b></tt></pre>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "Allocator3735929488">Allocator</a></pre>
+
+
+</td>
+
+<td>
+<p>Allocator type.</p>
+
+
+</td>
+
+<td>
+<pre>std::allocator&lt;<b>char</b>&gt;</pre>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link2">Base classes.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "80%" ALIGN = "left"><b>Class</b></TD><TD Width = "20%" ALIGN = "left"><b>Derivation Type</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a href = "#Comb_Probe_Fn3735929818">Comb_Probe_Fn</a></pre>
+
+
+</td>
+
+<td>
+<p>public</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a href = "#Probe_Fn3735929338">Probe_Fn</a></pre>
+
+
+</td>
+
+<td>
+<p>public</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a href = "basic_hash_assoc_cntnr.html"<tt>basic_hash_assoc_cntnr</tt></a></pre>
+
+
+</td>
+
+<td>
+<p>public</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link3">Policy definitions.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "30%" ALIGN = "left"><b>Type</b></TD><TD Width = "55%" ALIGN = "left"><b>Definition</b></TD><TD Width = "15%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "comb_probe_fn3735929914">comb_probe_fn</a></pre>
+
+
+</td>
+
+<td>
+<pre><a href = "#Comb_Probe_Fn3735929818">Comb_Probe_Fn</a></pre>
+
+
+</td>
+
+<td>
+<p>Combining probe functor type.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "probe_fn3735929402">probe_fn</a></pre>
+
+
+</td>
+
+<td>
+<pre><a href = "#Probe_Fn3735929338">Probe_Fn</a></pre>
+
+
+</td>
+
+<td>
+<p>Probe functor type.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link4">Constructors, destructor, and related.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre> gp_hash_assoc_cntnr
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Default constructor.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre> gp_hash_assoc_cntnr
+ (<b>const</b> <a href = "#Hash_Fn3735929222">Hash_Fn</a> &amp;r_hash_fn)</pre>
+
+
+</td>
+
+<td>
+<p>Constructor taking some policy objects. <font color = "#666666"><tt>r_hash_fn</tt></font> will be copied by the <a href = "#Hash_Fn3735929222"><tt>Hash_Fn</tt></a> object of the container object.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre> gp_hash_assoc_cntnr
+ (<b>const</b> <a href = "#Hash_Fn3735929222">Hash_Fn</a> &amp;r_hash_fn,
+ <b>const</b> <a href = "#Eq_Fn3735929016">Eq_Fn</a> &amp;r_eq_fn)</pre>
+
+
+</td>
+
+<td>
+<p>Constructor taking some policy objects. <font color = "#666666"><tt>r_hash_fn</tt></font> will be copied by the <a href = "#Hash_Fn3735929222"><tt>Hash_Fn</tt></a> object of the container object, and <font color = "#666666"><tt>r_eq_fn</tt></font> will be copied by the <a href = "#Eq_Fn3735929016"><tt>Eq_Fn</tt></a> object of the container object.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre> gp_hash_assoc_cntnr
+ (<b>const</b> <a href = "#Hash_Fn3735929222">Hash_Fn</a> &amp;r_hash_fn,
+ <b>const</b> <a href = "#Eq_Fn3735929016">Eq_Fn</a> &amp;r_eq_fn,
+ <b>const</b> <a href = "#Comb_Probe_Fn3735929818">Comb_Probe_Fn</a> &amp;r_comb_probe_fn)</pre>
+
+
+</td>
+
+<td>
+<p>Constructor taking some policy objects. <font color = "#666666"><tt>r_hash_fn</tt></font> will be copied by the <a href = "#Hash_Fn3735929222"><tt>Hash_Fn</tt></a> object of the container object, <font color = "#666666"><tt>r_eq_fn</tt></font> will be copied by the <a href = "#Eq_Fn3735929016"><tt>Eq_Fn</tt></a> object of the container object, and <font color = "#666666"><tt>r_comb_probe_fn</tt></font> will be copied by the <a href = "#Comb_Probe_Fn3735929818"><tt>Comb_Probe_Fn</tt></a> object of the container object.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre> gp_hash_assoc_cntnr
+ (<b>const</b> <a href = "#Hash_Fn3735929222">Hash_Fn</a> &amp;r_hash_fn,
+ <b>const</b> <a href = "#Eq_Fn3735929016">Eq_Fn</a> &amp;r_eq_fn,
+ <b>const</b> <a href = "#Comb_Probe_Fn3735929818">Comb_Probe_Fn</a> &amp;r_comb_probe_fn,
+ <b>const</b> <a href = "#Probe_Fn3735929338">Probe_Fn</a> &amp;r_probe_fn)</pre>
+
+
+</td>
+
+<td>
+<p>Constructor taking some policy objects. <font color = "#666666"><tt>r_hash_fn</tt></font> will be copied by the <a href = "#Hash_Fn3735929222"><tt>Hash_Fn</tt></a> object of the container object, <font color = "#666666"><tt>r_eq_fn</tt></font> will be copied by the <a href = "#Eq_Fn3735929016"><tt>Eq_Fn</tt></a> object of the container object, <font color = "#666666"><tt>r_comb_probe_fn</tt></font> will be copied by the <a href = "#Comb_Probe_Fn3735929818"><tt>Comb_Probe_Fn</tt></a> object of the container object, and <font color = "#666666"><tt>r_probe_fn</tt></font> will be copied by the <a href = "#Probe_Fn3735929338"><tt>Probe_Fn</tt></a> object of the container object.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre> gp_hash_assoc_cntnr
+ (<b>const</b> <a href = "#Hash_Fn3735929222">Hash_Fn</a> &amp;r_hash_fn,
+ <b>const</b> <a href = "#Eq_Fn3735929016">Eq_Fn</a> &amp;r_eq_fn,
+ <b>const</b> <a href = "#Comb_Probe_Fn3735929818">Comb_Probe_Fn</a> &amp;r_comb_probe_fn,
+ <b>const</b> <a href = "#Probe_Fn3735929338">Probe_Fn</a> &amp;r_probe_fn,
+ <b>const</b> <a href = "#Resize_Policy3735929904">Resize_Policy</a> &amp;r_resize_policy)</pre>
+
+
+</td>
+
+<td>
+<p>Constructor taking some policy objects. <font color = "#666666"><tt>r_hash_fn</tt></font> will be copied by the <a href = "#Hash_Fn3735929222"><tt>Hash_Fn</tt></a> object of the container object, <font color = "#666666"><tt>r_eq_fn</tt></font> will be copied by the <a href = "#Eq_Fn3735929016"><tt>Eq_Fn</tt></a> object of the container object, <font color = "#666666"><tt>r_comb_probe_fn</tt></font> will be copied by the <a href = "#Comb_Probe_Fn3735929818"><tt>Comb_Probe_Fn</tt></a> object of the container object, <font color = "#666666"><tt>r_probe_fn</tt></font> will be copied by the <a href = "#Probe_Fn3735929338"><tt>Probe_Fn</tt></a> object of the container object, and <font color = "#666666"><tt>r_resize_policy</tt></font> will be copied by the <a href = "#Resize_Policy3735929904"><tt>Resize_Policy</tt></a> object of the container object.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>template</b>&lt;
+ <b>class</b> It&gt;
+ gp_hash_assoc_cntnr
+ (It first_it,
+ It last_it)</pre>
+
+
+</td>
+
+<td>
+<p>Constructor taking iterators to a range of value_types. The value_types between <font color = "#666666"><tt>first_it</tt></font> and <font color = "#666666"><tt>last_it</tt></font> will be inserted into the container object.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>template</b>&lt;
+ <b>class</b> It&gt;
+ gp_hash_assoc_cntnr
+ (It first_it,
+ It last_it,
+ <b>const</b> <a href = "#Hash_Fn3735929222">Hash_Fn</a> &amp;r_hash_fn)</pre>
+
+
+</td>
+
+<td>
+<p>Constructor taking iterators to a range of value_types and some policy objects. The value_types between <font color = "#666666"><tt>first_it</tt></font> and <font color = "#666666"><tt>last_it</tt></font> will be inserted into the container object. <font color = "#666666"><tt>r_hash_fn</tt></font> will be copied by the <a href = "#Hash_Fn3735929222"><tt>Hash_Fn</tt></a> object of the container object.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>template</b>&lt;
+ <b>class</b> It&gt;
+ gp_hash_assoc_cntnr
+ (It first_it,
+ It last_it,
+ <b>const</b> <a href = "#Hash_Fn3735929222">Hash_Fn</a> &amp;r_hash_fn,
+ <b>const</b> <a href = "#Eq_Fn3735929016">Eq_Fn</a> &amp;r_eq_fn)</pre>
+
+
+</td>
+
+<td>
+<p>Constructor taking iterators to a range of value_types and some policy objects. The value_types between <font color = "#666666"><tt>first_it</tt></font> and <font color = "#666666"><tt>last_it</tt></font> will be inserted into the container object. <font color = "#666666"><tt>r_hash_fn</tt></font> will be copied by the <a href = "#Hash_Fn3735929222"><tt>Hash_Fn</tt></a> object of the container object, and <font color = "#666666"><tt>r_eq_fn</tt></font> will be copied by the <a href = "#Eq_Fn3735929016"><tt>Eq_Fn</tt></a> object of the container object.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>template</b>&lt;
+ <b>class</b> It&gt;
+ gp_hash_assoc_cntnr
+ (It first_it,
+ It last_it,
+ <b>const</b> <a href = "#Hash_Fn3735929222">Hash_Fn</a> &amp;r_hash_fn,
+ <b>const</b> <a href = "#Eq_Fn3735929016">Eq_Fn</a> &amp;r_eq_fn,
+ <b>const</b> <a href = "#Comb_Probe_Fn3735929818">Comb_Probe_Fn</a> &amp;r_comb_probe_fn)</pre>
+
+
+</td>
+
+<td>
+<p>Constructor taking iterators to a range of value_types and some policy objects. The value_types between <font color = "#666666"><tt>first_it</tt></font> and <font color = "#666666"><tt>last_it</tt></font> will be inserted into the container object. <font color = "#666666"><tt>r_hash_fn</tt></font> will be copied by the <a href = "#Hash_Fn3735929222"><tt>Hash_Fn</tt></a> object of the container object, <font color = "#666666"><tt>r_eq_fn</tt></font> will be copied by the <a href = "#Eq_Fn3735929016"><tt>Eq_Fn</tt></a> object of the container object, and <font color = "#666666"><tt>r_comb_probe_fn</tt></font> will be copied by the <a href = "#Comb_Probe_Fn3735929818"><tt>Comb_Probe_Fn</tt></a> object of the container object.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>template</b>&lt;
+ <b>class</b> It&gt;
+ gp_hash_assoc_cntnr
+ (It first_it,
+ It last_it,
+ <b>const</b> <a href = "#Hash_Fn3735929222">Hash_Fn</a> &amp;r_hash_fn,
+ <b>const</b> <a href = "#Eq_Fn3735929016">Eq_Fn</a> &amp;r_eq_fn,
+ <b>const</b> <a href = "#Comb_Probe_Fn3735929818">Comb_Probe_Fn</a> &amp;r_comb_probe_fn,
+ <b>const</b> <a href = "#Probe_Fn3735929338">Probe_Fn</a> &amp;r_probe_fn)</pre>
+
+
+</td>
+
+<td>
+<p>Constructor taking iterators to a range of value_types and some policy objects. The value_types between <font color = "#666666"><tt>first_it</tt></font> and <font color = "#666666"><tt>last_it</tt></font> will be inserted into the container object. <font color = "#666666"><tt>r_hash_fn</tt></font> will be copied by the <a href = "#Hash_Fn3735929222"><tt>Hash_Fn</tt></a> object of the container object, <font color = "#666666"><tt>r_eq_fn</tt></font> will be copied by the <a href = "#Eq_Fn3735929016"><tt>Eq_Fn</tt></a> object of the container object, <font color = "#666666"><tt>r_comb_probe_fn</tt></font> will be copied by the <a href = "#Comb_Probe_Fn3735929818"><tt>Comb_Probe_Fn</tt></a> object of the container object, and <font color = "#666666"><tt>r_probe_fn</tt></font> will be copied by the <a href = "#Probe_Fn3735929338"><tt>Probe_Fn</tt></a> object of the container object.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>template</b>&lt;
+ <b>class</b> It&gt;
+ gp_hash_assoc_cntnr
+ (It first_it,
+ It last_it,
+ <b>const</b> <a href = "#Hash_Fn3735929222">Hash_Fn</a> &amp;r_hash_fn,
+ <b>const</b> <a href = "#Eq_Fn3735929016">Eq_Fn</a> &amp;r_eq_fn,
+ <b>const</b> <a href = "#Comb_Probe_Fn3735929818">Comb_Probe_Fn</a> &amp;r_comb_probe_fn,
+ <b>const</b> <a href = "#Probe_Fn3735929338">Probe_Fn</a> &amp;r_probe_fn,
+ <b>const</b> <a href = "#Resize_Policy3735929904">Resize_Policy</a> &amp;r_resize_policy)</pre>
+
+
+</td>
+
+<td>
+<p>Constructor taking iterators to a range of value_types and some policy objects. The value_types between <font color = "#666666"><tt>first_it</tt></font> and <font color = "#666666"><tt>last_it</tt></font> will be inserted into the container object. <font color = "#666666"><tt>r_hash_fn</tt></font> will be copied by the <a href = "#Hash_Fn3735929222"><tt>Hash_Fn</tt></a> object of the container object, <font color = "#666666"><tt>r_eq_fn</tt></font> will be copied by the <a href = "#Eq_Fn3735929016"><tt>Eq_Fn</tt></a> object of the container object, <font color = "#666666"><tt>r_comb_probe_fn</tt></font> will be copied by the <a href = "#Comb_Probe_Fn3735929818"><tt>Comb_Probe_Fn</tt></a> object of the container object, <font color = "#666666"><tt>r_probe_fn</tt></font> will be copied by the <a href = "#Probe_Fn3735929338"><tt>Probe_Fn</tt></a> object of the container object, and <font color = "#666666"><tt>r_resize_policy</tt></font> will be copied by the <a href = "#Resize_Policy3735929904"><tt>Resize_Policy</tt></a> object of the container object.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre> gp_hash_assoc_cntnr
+ (<b>const</b> <font color = "olive">gp_hash_assoc_cntnr</font> &amp;r_other)</pre>
+
+
+</td>
+
+<td>
+<p>Copy constructor.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>virtual</b>
+ ~gp_hash_assoc_cntnr
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Destructor.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><font color = "olive">gp_hash_assoc_cntnr</font> &amp;
+ <b>operator</b>=
+ (<b>const</b> <font color = "olive">gp_hash_assoc_cntnr</font> &amp;r_other)</pre>
+
+
+</td>
+
+<td>
+<p>Assignment operator.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>void</b>
+ swap
+ (<font color = "olive">gp_hash_assoc_cntnr</font> &amp;r_other)</pre>
+
+
+</td>
+
+<td>
+<p>Swaps content.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link5">Policy access methods.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a href = "#comb_probe_fn3735929914">comb_probe_fn</a> &amp;
+ get_comb_probe_fn
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Access to the <a href = "#comb_probe_fn3735929914"><tt>comb_probe_fn</tt></a> object.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>const</b> <a href = "#comb_probe_fn3735929914">comb_probe_fn</a> &amp;
+ get_comb_probe_fn
+ () <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Const access to the <a href = "#comb_probe_fn3735929914"><tt>comb_probe_fn</tt></a> object.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a href = "#probe_fn3735929402">probe_fn</a> &amp;
+ get_probe_fn
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Access to the <a href = "#probe_fn3735929402"><tt>probe_fn</tt></a> object.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>const</b> <a href = "#probe_fn3735929402">probe_fn</a> &amp;
+ get_probe_fn
+ () <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Const access to the <a href = "#probe_fn3735929402"><tt>probe_fn</tt></a> object.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+
+
+</body>
+
+</html>
+
+
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/gp_hash_ds_tag.html b/libstdc++-v3/docs/html/ext/pb_assoc/gp_hash_ds_tag.html
new file mode 100644
index 0000000..247a193
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/gp_hash_ds_tag.html
@@ -0,0 +1,74 @@
+
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+
+
+<html>
+<head>
+<title>gp_hash_ds_tag Interface
+</title>
+
+</head>
+
+<body>
+<h1>
+<tt>gp_hash_ds_tag
+</tt>
+
+ Interface
+
+
+</h1>
+
+<p>General-probing hash data-structure tag.
+</p>
+
+<ol>
+<li>
+<a href = "../../../../include/ext/pb_assoc/ds_trait.hpp"><tt>ds_trait.hpp</tt>
+</a>
+
+</li>
+
+<li>
+<a href = "#link1">Base classes.
+</a>
+
+</li>
+
+</ol>
+
+
+<h2>
+<a name = "link1">Base classes.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "80%" ALIGN = "left"><b>Class</b></TD><TD Width = "20%" ALIGN = "left"><b>Derivation Type</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a href = "basic_hash_ds_tag.html"><tt>basic_hash_ds_tag</tt></a></pre>
+
+
+</td>
+
+<td>
+<p>public</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+
+
+</body>
+
+</html>
+
+
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/gp_hash_policy_cd.jpg b/libstdc++-v3/docs/html/ext/pb_assoc/gp_hash_policy_cd.jpg
new file mode 100644
index 0000000..395349f
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/gp_hash_policy_cd.jpg
Binary files differ
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/hash_and_probe_general.html b/libstdc++-v3/docs/html/ext/pb_assoc/hash_and_probe_general.html
new file mode 100644
index 0000000..c4b4833
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/hash_and_probe_general.html
@@ -0,0 +1,45 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+<html>
+<head>
+<title>Hash and Probe Policies</title>
+<meta name="GENERATOR" content="Microsoft Visual Studio .NET 7.1">
+<meta name="vs_targetSchema" content="http://schemas.microsoft.com/intellisense/ie5">
+</head>
+<body bgcolor = "white">
+<h1>Hash and Probe Policies</h1>
+
+
+<p>
+ As mentioned in
+<a href = "hash_policies.html">Hash Policies</a>,
+some of the containers require a ranged-hash function policy for
+mapping key types into a non-negative integral type in a range.
+<i>E.g.</i>, collision-based containers
+(<a href = "cc_ht_map_interface.html"><tt>cc_ht_map</tt></a>,
+<a href = "cc_ht_set_interface.html"><tt>cc_ht_set</tt></a>,
+<a href = "cc_ht_multimap_interface.html"><tt>cc_ht_multimap</tt></a>,
+and
+<a href = "cc_ht_multiset_interface.html"><tt>cc_ht_multiset</tt></a>),
+require a ranged-hash function.
+</p>
+
+<p>
+ Similarly, some hash tables
+need a ranged-probe function policy for mapping
+key types into a sequence of non-negative integral types in a range.
+<i>E.g.</i>, probing-based containers
+(<a href = "gp_ht_map_interface.html"><tt>gp_ht_map</tt></a>,
+<a href = "gp_ht_set_interface.html"><tt>gp_ht_set</tt></a>,
+<a href = "gp_ht_multimap_interface.html"><tt>gp_ht_multimap</tt></a>,
+and
+<a href = "gp_ht_multiset_interface.html"><tt>gp_ht_multiset</tt></a>),
+require a ranged-hash function.
+</p>
+
+<p>
+ <a href = "interface.html#policy_classes">Policy Classes</a>
+contains classes for creating ranged-hash and ranged-probe function policies.
+</p>
+
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/hash_based_containers.html b/libstdc++-v3/docs/html/ext/pb_assoc/hash_based_containers.html
new file mode 100644
index 0000000..9fea0e6
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/hash_based_containers.html
@@ -0,0 +1,1056 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+<html>
+ <head>
+ <title>Hash-Based Containers</title>
+ <meta name="GENERATOR" content="Microsoft Visual Studio .NET 7.1">
+ <meta name="vs_targetSchema" content="http://schemas.microsoft.com/intellisense/ie5">
+ </head>
+
+<body bgcolor = "white">
+
+<h1>Hash-Based Containers</h1>
+
+<p>
+ This section describes hash-based containers. It is organized
+as follows.
+</p>
+
+<ol>
+ <li>
+ <a href = "#overview">Overview</a> is an overview.
+ </li>
+ <li>
+ <a href = "#hash_policies">Hash Policies</a> discusses
+ hash policies.
+ </li>
+ <li>
+ <a href = "#resize_policies">Resize Policies</a> discusses
+ resize policies.
+ </li>
+ <li>
+ <a href = "#policy_interaction">Policy Interaction</a> discusses
+ interaction between policies.
+ </li>
+</ol>
+
+
+
+<h2><a name = "overview">Overview</a></h2>
+
+
+<p>
+ Figure
+<a href = "#hash_cd">Hash-based containers</a>
+ shows the container-hierarchy; the hash-based containers are circled.
+<a href = "cc_hash_assoc_cntnr.html"><tt>cc_hash_assoc_cntnr</tt></a>
+is a collision-chaining hash-based container;
+<a href = "gp_hash_assoc_cntnr.html"><tt>gp_hash_assoc_cntnr</tt></a>
+is a (general) probing hash-based container.
+</p>
+
+<h6 align = "center">
+<a name = "hash_cd">
+<img src = "hash_cd.jpg" width = "70%" alt = "no image">
+</h6>
+<h6 align = "center">
+</a>
+Hash-based containers.
+</h6>
+
+<p>
+ The collision-chaining hash-based container has the following declaration.
+</p>
+<pre>
+<b>template</b>&lt;
+ <b>typename</b> Key,
+ <b>typename</b> Data,
+ <b>class</b> Hash_Fn = std::hash&lt;Key&gt;,
+ <b>class</b> Eq_Fn = std::equal_to&lt;Key&gt;,
+ <b>class</b> Comb_Hash_Fn =
+ <a href = "direct_mask_range_hashing.html">direct_mask_range_hashing</a>&lt;&gt;
+ <b>class</b> Resize_Policy = <i>default explained below.</i>
+ <b>bool</b> Store_Hash = <b>false</b>,
+ <b>class</b> Allocator =
+ std::allocator&lt;<b>char</b>&gt; &gt;
+<b>class</b> <a href = "cc_hash_assoc_cntnr.html">cc_hash_assoc_cntnr</a>;
+</pre>
+
+<p>
+ The parameters have the following meaning:
+</p>
+<ol>
+ <li> <tt>Key</tt> is the key type.
+ </li>
+ <li> <tt>Data</tt> is the data-policy, and is explained in
+<a href = "ms_gen.html#ds_policy">Mapping-Semantics Genericity::Data Types as a Policy</a>.
+ </li>
+ <li> <tt>Hash_Fn</tt> is a key hashing functor.</li>
+ <li> <tt>Eq_Fn</tt> is a key equivalence functor.</li>
+ <li> <tt>Comb_Hash_Fn</tt> is a <i>range-hashing_functor</i>; it
+describes how to translate hash values into positions within the table.
+This is described in
+<a name = "#hash_policies">Hash Policies</a>.</li>
+ </li>
+ <li> <tt>Resize_Policy</tt> describes how a container object should
+change its internal size. This is described in
+<a name = #resize_policies">Resize Policies</a>.</li>
+ <li> <tt>Store_Hash</tt> indicates whether the hash value should
+be stored with each entry. This is described in
+<a name = "#policy_interaction">Policy Interaction</a>.</li>
+ <li> <tt>Allocator</tt> is (surprisingly) an allocator type.
+ </li>
+</ol>
+
+<p>
+ The probing hash-based container has the following declaration.
+</p>
+<pre>
+<b>template</b>&lt;
+ <b>typename</b> Key,
+ <b>typename</b> Data,
+ <b>class</b> Hash_Fn =
+ std::hash&lt;
+ Key&gt;,
+ <b>class</b> Eq_Fn =
+ std::equal_to&lt;
+ Key&gt;,
+ <b>class</b> Comb_Probe_Fn =
+ <a href = "direct_mask_range_hashing.html">direct_mask_range_hashing</a>&lt;&gt;
+ <b>class</b> Probe_Fn = <i>default explained below.</i>
+ <b>class</b> Resize_Policy = <i>default explained below.</i>
+ <b>bool</b> Store_Hash = <b>false</b>,
+ <b>class</b> Allocator =
+ std::allocator&lt;<b>char</b>&gt; &gt;
+<b>class</b> <a href = "gp_hash_assoc_cntnr.html">gp_hash_assoc_cntnr</a>;
+</pre>
+
+<p>
+ The parameters are identical to those of the collision-chaining container, except
+for the following.
+</p>
+<ol>
+ <li> <tt>Comb_Probe_Fn</tt> describes how to transform a probe sequence into
+a sequence of positions within the table.
+ </li>
+ <li> <tt>Probe_Fn</tt> describes a probe sequence policy.</li>
+</ol>
+
+
+<p>
+ Some of the default template values depend on the values of other parameters,
+and are explained in
+<a name = "#policy_interaction">Policy Interaction</a>.
+</p>
+
+<h2><a name = "hash_policies">Hash Policies</h2></a>
+<p>
+ This subsection describes hash policies. It is organized as follows:
+</p>
+<ol>
+ <li> <a href = "#general_terms">General Terms</a> describes
+ some general terms.
+ </li>
+ <li> <a href = "#range_hashing_fns">Range-Hashing Functions</a>
+ describes range-hasing functions.</li>
+ <li> <a href = "#hash_policies_ranged_hash_policies">Ranged-Hash Functions</a>
+ describes ranged-hash functions. </li>
+ <li> <a href = "#pb_assoc_imp">Implementation in <tt>pb_assoc</tt></a>
+ describes the implementation of these concepts in <tt>pb_assoc</tt>.
+ </li>
+</ol>
+
+
+<h3><a name="general_terms">General Terms</a></h3>
+
+<p>
+ There
+are actually three functions involved in transforming a key into a hash-table's
+position (see Figure
+<a href = "#hash_ranged_hash_range_hashing_fns">
+Hash runctions, ranged-hash functions, and range-hashing functions
+</a>):
+</p>
+<ol>
+ <li>
+ A <i>ranged-hash</i> function, which maps keys into an interval of the
+ non-negative integrals. This is the function actually required by the
+ hash-table algorithm.
+ </li>
+ <li>
+ A hash function, which maps keys into non-negative integral types. This is
+ typically specified by the writer of the key class.
+ </li>
+ <li>
+ A <i>range-hashing</i> function, which maps non-negative integral types into an
+ interval of non-negative integral types.
+ </li>
+</ol>
+
+<h6 align = "center">
+<a name = "hash_ranged_hash_range_hashing_fns">
+<img src = "hash_ranged_hash_range_hashing_fns.jpg" width = "70%" alt = "no image">
+</h6>
+<h6 align = "center">
+</a>
+Hash runctions, ranged-hash functions, and range-hashing functions.
+</h6>
+
+<p>
+ Let <i>U</i> be a domain (<i>e.g.</i>, the integers, or the strings of 3
+ characters). A hash-table algorithm needs to map elements of <i>U</i> "uniformly"
+ into the range <i>[0,..., m - 1]</i> (where <i>m</i> is a non-negative integral
+ value, and is, in general, time varying). <i>I.e.</i>, the algorithm needs a <i>ranged-hash</i>
+ function
+</p>
+<p>
+ <i>f : U &times; Z<sub>+</sub> &rarr; Z<sub>+</sub> </i>,
+</p>
+<p>
+ such that for any <i>u</i> in <i>U</i>
+,
+</p>
+<p>
+ <i>0 &le; f(u, m) &le; m - 1 </i>,
+</p>
+<p>
+ and which has "good uniformity" properties [<a href="references.html#knuth98sorting">knuth98sorting</a>].
+ One common solution is to use the composition of the hash function
+</p>
+<p>
+ <i>h : U &rarr; Z<sub>+</sub> </i>,
+</p>
+<p>
+ which maps elements of <i>U</i> into the non-negative integrals, and
+</p>
+<p>
+ <i>g : Z<sub>+</sub> &times; Z<sub>+</sub> &rarr; Z<sub>+</sub>, </i>
+</p>
+<p>
+ which maps a non-negative hash value, and a non-negative range upper-bound into
+ a non-negative integral in the range between 0 (inclusive) and the range upper
+ bound (exclusive), <i>i.e.</i>, for any <i>r</i> in <i>Z<sub>+</sub></i>,
+</p>
+<p>
+ <i>0 &le; g(r, m) &le; m - 1 </i>.
+</p>
+<p>
+ The resulting ranged-hash function, is
+</p>
+<p>
+ <i><a name="eqn:ranged_hash_composed_of_hash_and_range_hashing">f(u , m) = g(h(u), m) </a>
+ </i>(1) .
+</p>
+
+<p>
+ From the above, it is obvious that given <i>g</i> and <i>h</i>, <i>f</i> can
+ always be composed (however the converse is not true). The STL's hash-based
+ containers allow specifying a hash function, and use a hard-wired range-hashing function; the ranged-hash function is implicitly composed.
+</p>
+
+
+<p>
+ The above describes the case where a key is to be mapped into a <i>single
+position</i> within a hash table, <i>e.g.</i>, in a collision-chaining table.
+In other cases, a key is to be mapped into a <i>sequence of poisitions</i>
+within a table, <i>e.g.</i>, in a probing table.
+</p>
+<p>
+ Similar terms apply in this case: the table requires a <i>ranged probe</i>
+function, mapping a key into a sequence of positions withing the table. This is
+typically acheived by composing a <i>hash function</i> mapping the key
+into a non-negative integral type, a <i>probe</i> function transforming the
+hash value into a sequence of hash values, and a <i>range-hashing</i> function
+transforming the sequence of hash values into a sequence of positions.
+</p>
+
+
+<h3><a name="range_hashing_fns">Range-Hashing Functions</a></h3>
+
+<p>
+ Some common choices for range-hashing functions are the division,
+ multiplication, and middle-square methods [<a href="references.html#knuth98sorting">knuth98sorting</a>],
+ defined as
+</p>
+<p>
+ <i><a name="eqn:division_method">g(r, m) = r mod m </a></i>(2) ,
+</p>
+<p>
+ <i>g(r, m) = &lceil; u/v ( a r mod v ) &rceil; </i>,
+</p>
+<p>
+ and
+</p>
+<p>
+ <i>g(r, m) = &lceil; u/v ( r<sup>2</sup> mod v ) &rceil; </i>,
+</p>
+<p>
+respectively, for some positive integrals <i>u</i> and <i>v</i> (typically
+powers of 2), and some <i>a</i>. Each of these range-hashing functions works
+best for some different setting.
+</p>
+<p>
+ The division method <a href="#division_method">(2)</a> is a very common
+ choice. However, even this single method can be implemented in two very
+ different ways. It is possible to implement <a href="#division_method">(2)</a>
+ using the low level <i>%</i> (modulo) operation (for any <i>m</i>), or the low
+ level <i>&amp;</i> (bit-mask) operation (for the case where <i>m</i> is a power of
+ 2), <i>i.e.</i>,
+</p>
+<p>
+ <i><a name="eqn:division_method_prime_mod">g(r, m) = r % m </a></i>(3) ,
+</p>
+<p>
+ and
+</p>
+<p>
+ <a name="eqn:division_method_bit_mask">
+ <i>g(r, m) = r &amp; m - 1, ( m = 2<sup>k</sup>
+ </i>
+ for some<i> k) </i></a>(4) ,
+</p>
+<p>
+ respectively.
+</p>
+<p>
+ The <i>%</i> (modulo) implementation <a href="#division_method_prime_mod">(3)</a>
+ has the advantage that for <i>m</i> a prime far from a power of 2, <i>g(r, m)</i>
+ is affected by all the bits of <i>r</i> (minimizing the chance of collision).
+ It has the disadvantage of using the costly modulo operation. This method is
+ hard-wired into SGI's implementation [<a href="references.html#sgi_stl">sgi_stl</a>].
+</p>
+
+<p>
+ The <i>&amp;</i> (bit-mask) implementation <a href="#division_method_bit_mask">(4)</a>
+ has the advantage of relying on the fast bitwise and operation. It has the
+ disadvantage that for <i>g(r, m)</i> is affected only by the low order bits of <i>r</i>.
+ This method is hard-wired into Dinkumware's implementation [<a href="references.html#dinkumware_stl">dinkumware_stl</a>].
+</p>
+
+
+
+
+<h3><a name="hash_policies_ranged_hash_policies">Ranged-Hash Functions</a></h3>
+
+<p>
+ In some less frequent cases it is beneficial to allow the client to
+directly specify a ranged-hash hash function. It is true, that the writer of
+the ranged-hash function cannot rely on the values of <i>m</i> having specific
+numerical properties suitable for hashing (in the sense used in [<a href="references.html#knuth98sorting">knuth98sorting</a>]),
+since the values of <i>m</i> are determined by a resize policy with possibly
+orthogonal considerations.
+</p>
+
+<p>
+ There are two cases where a ranged-hash function can be superior. The firs is when using perfect hashing
+[<a href="references.html#knuth98sorting">knuth98sorting</a>]; the second
+is when the values of <i>m</i> can be used to estimate the
+"general" number of distinct values required. This is described in the following.
+</p>
+
+<p>
+ Let
+</p>
+
+<p>
+ <i>s = [ s<sub>0</sub>,..., s<sub>t - 1</sub>] </i>
+</p>
+
+<p>
+ be a string of <i>t</i> characters, each of which is from domain <i>S</i>.
+Consider the following ranged-hash function:
+</p>
+
+<p>
+ <a name="eqn:total_string_dna_hash">
+ <i>
+ f<sub>1</sub>(s, m) =
+ &sum; <sub>i =
+ 0</sub><sup>t - 1</sup> s<sub>i</sub> a<sup>i</sup> </i>mod<i> m </i>
+ </a> (5) ,
+</p>
+
+<p>
+ where <i>a</i> is some non-negative integral value. This is the standard
+string-hashing function used in SGI's implementation (with <i>a = 5</i>) [<a href="references.html#sgi_stl">sgi_stl</a>].
+Its advantage is that it takes into account all of the characters of the
+string.
+</p>
+
+<p>
+ Now assume that <i>s</i> is the string representation of a of a long DNA
+sequence (and so <i>S = {'A', 'C', 'G', 'T'}</i>). In this case, scanning the
+entire string might be prohibitively expensive. A possible alternative might be
+to use only the first <i>k</i> characters of the string, where
+</p>
+
+<p>
+ k <sup>|S|</sup> &ge; m ,
+</p>
+<p>
+ <i>i.e.</i>, using the hash function
+</p>
+<p>
+ <a name="eqn:only_k_string_dna_hash"><i>f<sub>2</sub>(s, m) = &sum; <sub>i = 0</sub><sup>k
+ - 1</sup> s<sub>i</sub> a<sup>i</sup> </i>mod <i>m </i></a>, (6)
+</p>
+<p>
+ requiring scanning over only
+</p>
+<p>
+ <i>k = </i>log<i><sub>4</sub>( m ) </i>
+</p>
+<p>
+ characters.
+</p>
+<p>
+ Other more elaborate hash-functions might scan <i>k</i> characters starting at
+ a random position (determined at each resize), or scanning <i>k</i> random
+ positions (determined at each resize), <i>i.e.</i>, using
+</p>
+<p>
+ <i>f<sub>3</sub>(s, m) = &sum; <sub>i = r<sub>0</sub></sub><sup>r<sub>0</sub> + k - 1</sup>
+ s<sub>i</sub> a<sup>i</sup> </i>mod <i>m </i>,
+</p>
+<p>
+ or
+</p>
+<p>
+ <i>f<sub>4</sub>(s, m) = &sum; <sub>i = 0</sub><sup>k - 1</sup> s<sub>r<sub>i</sub></sub>
+ a<sup>r<sub>i</sub></sup> </i>mod <i>m </i>,
+</p>
+<p>
+<p>
+ respectively, for <i>r<sub>0</sub>,..., r<sub>k-1</sub></i> each in the
+ (inclusive) range <i>[0,...,t-1]</i>.
+</p>
+
+
+<h3><a name="pb_assoc_imp">Implementation in <tt>pb_assoc</tt></a></h3>
+
+<p>
+<a href = "cc_hash_assoc_cntnr.html"><tt>cc_hash_assoc_cntnr</tt></a> is
+parameterized by <tt>Hash_Fn</tt> and <tt>Comb_Hash_Fn</tt>, a hash functor
+and a combining hash functor, respectively.
+</p>
+
+<p>
+ For any hash functor except <a href = "null_hash_fn.html"><tt>null_hash_fn</tt></a>,
+one of the
+<a href = "concepts.html#concepts_null_policies">Concepts::Null Policy Classes</a>,
+then <tt>Comb_Hash_Fn</tt> is considered a range-hashing functor.
+The container will synthesize a ranged-hash functor from both. For example, Figure
+<a href = "#hash_range_hashing_seq_diagram">
+Insert hash sequence diagram
+</a>
+shows an <tt>insert</tt> sequence diagram. The user inserts an element (point A),
+the container transforms the key into a non-negative integral using the hash
+functor (points B and C), and transforms the result into a position
+using the combining functor (points D and E).
+</p>
+
+<h6 align = "center">
+<a name = "hash_range_hashing_seq_diagram">
+<img src = "hash_range_hashing_seq_diagram.jpg" width = "70%" alt = "no image">
+</a>
+</h6>
+<h6 align = "center">
+Insert hash sequence diagram.
+</h6>
+
+
+<p>
+ <tt>pb_assoc</tt> contains the following range-hashing policies:
+</p>
+
+<ol>
+ <li>
+<a href = "direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+and
+<a href = "direct_mod_range_hashing.html"><tt>direct_mod_range_hashing</tt></a>
+are range-hashing functions based on a bit-mask and a modulo operation, respectively.
+ </li>
+</ol>
+
+
+<p>
+ If <tt>Comb_Hash_Fn</tt> is instantiated by
+<a href = "null_hash_fn.html"><tt>null_hash_fn</tt></a>,
+and a combining-hash functor, the container treats
+the combining hash functor as a ranged-hash function. For example, Figure
+<a href = "#hash_range_hashing_seq_diagram2">
+Insert hash sequence diagram with a null combination policy
+</a>
+shows an <tt>insert</tt> sequence diagram. The user inserts an element (point A),
+the container transforms the key into a position
+using the combining functor (points B and C).
+</p>
+
+
+<h6 align = "center">
+<a name = "hash_range_hashing_seq_diagram2">
+<img src = "hash_range_hashing_seq_diagram2.jpg" width = "70%" alt = "no image">
+</a>
+</h6>
+<h6 align = "center">
+Insert hash sequence diagram with a null combination policy.
+</h6>
+
+<p>
+ Similarly,
+<a href = "gp_hash_assoc_cntnr.html"></a><tt>gp_hash_assoc_cntnr</tt>
+is parameterized by <tt>Hash_Fn</tt>, <tt>Probe_Fn</tt>, and
+<tt>Comb_Probe_Fn</tt>. As before, if <tt>Probe_Fn</tt>
+and <tt>Comb_Probe_Fn</tt> are, respectively,
+<a href = "null_hash_fn.html"><tt>null_hash_fn</tt></a> and
+<a href = "null_probe_fn.html"><tt>null_probe_fn</tt></a>,
+then <tt>Comb_Probe_Fn</tt> is a ranged-probe functor. Otherwise, <tt>Hash_Fn</tt>
+is a hash functor, <tt>Probe_Fn</tt> is a functor for offsets from a hash value,
+and <tt>Comb_Probe_Fn</tt> transforms a probe sequence into a sequence of positions
+within the table.
+</p>
+
+<p>
+ <tt>pb_assoc</tt> contains the following probe policies:
+</p>
+
+<ol>
+ <li>
+<a href = "linear_probe_fn.html"><tt>linear_probe_fn</tt></a> is a linear probe
+function.
+ </li>
+ <li>
+<a href = "quadratic_probe_fn.html"><tt>quadratic_probe_fn</tt></a> is
+a quadratic probe function.
+ </li>
+</ol>
+
+
+
+
+
+
+
+
+
+<h2><a name = "resize_policies">Resize Policies</a></h2>
+
+<p>
+ This subsection describes resize policies. It is organized as follows:
+</p>
+
+<ol>
+ <li> <a href = "#general">General Terms</a> describes general
+ terms.
+ </li>
+ <li> <a href = "#size_policies">Size Policies</a> describes size
+ policies.
+ </li>
+ <li> <a href = "#trigger_policies">Trigger Policies</a> describes trigger
+ policies.
+ </li> <li> <a href = "#imp_pb_assoc">Implementation in <tt>pb_assoc</tt></a>
+ describes the implementation of these concepts in <tt>pb_assoc</tt>.
+ </li>
+</ol>
+
+
+<h3><a name = "general">General Terms</a></h3>
+
+<p>
+ Hash-tables, as opposed to trees, do not naturally grow or shrink. It
+is necessary to specify policies to determine how and when a hash table should change
+its size.
+</p>
+
+<p>
+ In general, resize policies can be decomposed into (probably orthogonal)
+policies:
+</p>
+<ol>
+ <li> A <i>size policy</i> indicating <i>how</i> a hash table should
+grow (<i>e.g.,</i> it should multiply by powers of 2).
+ </li>
+ <li> A <i>trigger policy</i> indicating <i>when</i> a hash table should
+grow (<i>e.g.,</i> a load factor is exceeded).
+ </li>
+</ol>
+
+
+
+<h3><a name = "size_policies">Size Policies</a></h3>
+
+<p>
+ Size policies determine how a hash table
+changes size. These policies are simple, and there are relatively
+few sensible options. An exponential-size policy (with the initial
+size and growth factors both powers of 2) works well with a
+mask-based range-hashing function (see the <a href = "hash_policies.html#hash_policies_range_hashing_policies">Range-Hashing Policies</a> subsection),
+and is the
+hard-wired policy used by Dinkumware
+[<a href = "references.html#dinkumware_stl">dinkumware_stl</a>]. A
+prime-list based policy works well with a modulo-prime range
+hashing function (see the <a href = "hash_policies.html#hash_policies_range_hashing_policies">Range-Hashing Policies</a> subsection),
+and is the
+hard-wired policy used by SGI's implementation
+[<a href = "references.html#sgi_stl">sgi_stl</a>].
+</p>
+
+
+
+
+<h3><a name = "trigger_policies">Trigger Policies</a></h3>
+
+<p>
+ Trigger policies determine when a hash table changes size.
+Following is a description of two polcies: <i>load-check</i>
+policies, and a collision-check policies.
+</p>
+
+<p>
+ Load-check policies are straightforward. The user
+specifies two factors, <i>&alpha;<sub>min</sub></i> and <i>&alpha;<sub>max</sub></i>, and
+the hash table maintains the invariant that
+</p>
+<p>
+ <i>
+ <a name = "eqn:load_factor_min_max">
+ &alpha;<sub>min</sub>
+ &le;
+ (number of stored elements) / (hash-table size)
+ &le;
+ &alpha;<sub>max</sub>
+ </a>
+ </i>
+ (1)
+ .
+</p>
+
+<p>
+ Collision-check policies work in the opposite direction of
+load-check policies. They focus on keeping the number of
+collisions moderate and hoping
+that the size of the table will not grow very large,
+instead of keeping a moderate load-factor and
+hoping that the number of collisions will be small.
+A
+maximal collision-check policy resizes when the shortest
+probe-sequence grows too large.
+</p>
+
+
+<p>
+ Consider Figure
+<a href = "#balls_and_bins">Balls and bins</a>.
+ Let the size of the hash table be denoted by <i>m</i>, the
+length of a probe sequence be denoted by <i>k</i>, and some load
+factor be denoted by &alpha;. We would like to calculate the
+minimal length of <i>k</i>, such that if there were <i>&alpha; m</i> elements
+in the hash table, a probe sequence of length <i>k</i> would be found
+with probability at most <i>1/m</i>.
+</p>
+
+<h6 align = "center">
+<a name = "balls_and_bins">
+<img src = "balls_and_bins.jpg" width = "70%" alt = "no image">
+</a>
+</h6>
+<h6 align = "center">
+Balls and bins.
+</h6>
+
+
+<p>
+ Denote the probability that a probe sequence of length <i>k</i>
+appears in bin <i>i</i> by <i>p<sub>i</sub></i>, the length of the probe sequence
+of bin <i>i</i> by <i>l<sub>i</sub></i>, and assume uniform distribution.
+Then
+</p>
+ <p>
+ <a name = "eqn:prob_of_p1">
+ <i>p<sub>1</sub>
+ = </i>(3)
+ </a>
+ </p>
+ <p>
+ <i>
+ <b>P</b>(l<sub>1</sub> &ge; k)
+ =
+ </i>
+ </p>
+ <p>
+ <i><b>P</b>(l<sub>1</sub> &ge; &alpha; ( 1 + k / &alpha; - 1 )
+ &le; </i>(a)
+ </p>
+ <p>
+ <i>
+ e
+ ^
+ (
+ -
+ (
+ &alpha; ( k / &alpha; - 1 )<sup>2</sup>
+ )
+ /2
+ )
+ </i>
+ ,
+</p>
+<p>
+ where (a) follows from the Chernoff bound
+[<a href = "references.html#motwani95random">motwani95random</a>].
+To
+calculate the probability that <i>some</i> bin contains a probe
+sequence greater than <i>k</i>, we note that the <i>l<sub>i</sub></i> are
+negatively-dependent
+[<a href = "references.html#dubhashi98neg">dubhashi98neg</a>].
+Let <i><b>I</b>(.)</i>
+denote the indicator function. Then
+ <p>
+ <a name = "eqn:at_least_k_i_n_some_bin">
+ <i><b>P</b>( exists<sub>i</sub> l<sub>i</sub> &ge; k )
+ = </i>(3)
+ </a>
+ </p>
+ <p>
+ <i>
+ <b>P</b>
+ (
+ &sum; <sub>i = 1</sub><sup>m</sup>
+ <b>I</b>(l<sub>i</sub> &ge; k) &ge; 1
+ )
+ =
+ </i>
+ </p>
+ <p>
+ <i>
+ <b>P</b>
+ (
+ &sum; <sub>i = 1</sub><sup>m</sup>
+ <b>I</b>
+ (
+ l<sub>i</sub> &ge; k
+ )
+ &ge;
+ m p<sub>1</sub> ( 1 + 1 / (m p<sub>1</sub>) - 1 )
+ )
+ &le; </i>(a)
+ </p>
+ <p>
+ <i>
+ e
+ ^
+ (
+ (
+ -
+ m p<sub>1</sub>
+ (
+ 1 / (m p<sub>1</sub>) - 1
+ )
+ <sup>2</sup>
+ )
+ /
+ 2
+ )
+ ,
+ </i>
+ </p>
+<p>
+where (a) follows from the fact that the Chernoff bound can be
+applied to negatively-dependent variables
+[<a href = "references.html#dubhashi98neg">dubhashi98neg</a>].
+Inserting <a href = "#prob_of_p1">(2)</a> into
+<a href = "#at_least_k_i_n_some_bin">(3)</a>, and equating with <i>1/m</i>,
+we obtain
+</p>
+<p>
+ <i>
+ k
+ ~
+ &radic;
+ (
+ 2 &alpha; </i>ln<i> 2 m </i>ln<i>(m) )
+ )
+ </i>
+ .
+</p>
+
+
+
+
+
+
+
+
+
+<h3><a name = "imp_pb_assoc">Implementation in <tt>pb_assoc</tt></a></h3>
+
+<p>
+ The resize policies in the previous subsection are conceptually straightforward. The design
+of hash-based containers' size-related interface is complicated by some factors.
+</p>
+<ol>
+ <li> Most containers, <i>i.e.</i> lists, trees, and vectors, have a single "size" concept. There is no
+distinction between the number of entries the container holds and the number of entries it is using. This,
+of course, is not the case for hash-based containers. Moreover, even describing the
+"actual" size of a hash-based container (as opposed to its logical size) is difficult - a probing-based container
+holds entries to elements, even those it does not use, while a chaining-based container holds pointers to entries.
+ </li>
+ <li>
+ The policies mentioned above operate in terms of invariants. <i>E.g.</i> a load-check trigger policy
+maintains an invariant concerning the load factor of a container object. This is sometimes too rigid:
+ <ol>
+ <li>In some cases it is desirable to allow controlled override of an entire policy, <i>e.g.</i> by externally resizing a container object (or giving it an initial size, which is a special case of externally resizing the container).
+ </li>
+ <li>
+ In other cases it is desirable to allow changing the specifics of a policy in runtime, <i>e.g.</i>, changing the load factors of a load-check policy.
+ </li>
+ </ol>
+ </li>
+ <li>
+ Resize policies interact strongly with hash policies. Performance-wise, for example, it is undesirable to use an exponential size policy of powers of two with a modulo range-hashing function, and it is undesirable to use a prime size policy with a mask range-hashing function. In other cases, the effects are more dramatic. For example, using a quadratic probe function with an exponential size policy will probably cause cases where the container object has available entries which are never reached by the probe function. (<a href = "hash_policies.html">Hash Policies</a>
+discusses the previous concepts.)
+ </li>
+</ol>
+
+<p>
+ Clearly, the more of these points an interface addresses, the greater its flexibility but the lower its encapsulation and uniformity between associative containers.
+</p>
+
+
+
+<p>
+ This library attempts to address these types of problems by delegating all size-related functionality to
+policy classes. Hash-based containers
+are parameterized by a resize-policy class (among others), and derive publicly from
+the resize-policy class
+[<a href = "references.html#alexandrescu01modern">alexandrescu01modern</a>]
+ <i>E.g.</i>, a collision-chaining
+hash table is defined as follows:
+</p>
+<pre>
+cc_ht_map&lt;
+ <b>class</b> Key,
+ <b>class</b> Data,
+ ...
+ <b>class</b> Resize_Policy
+ ...&gt; :
+ <b>public</b> Resize_Policy
+</pre>
+
+<p>
+ The containers themselves lack any functionality or public interface for manipulating sizes. A container
+object merely forwards events to its resize policy object and queries it for needed actions.
+</p>
+
+<p>
+ Figure
+<a href = "#insert_resize_sequence_diagram1">
+Insert resize sequence diagram
+</a>
+shows a (possible) sequence diagram of an insert operation.
+The user inserts an element; the hash table
+notifies its resize policy that a search has started (point A);
+in this case, a single collision is encountered - the table
+notifies its resize policy of this (point B); the container
+finally notifies its resize policy that the search has ended (point C);
+it then queries its resize policy whether a resize is needed, and if so,
+what is the new size (points D to G); following the resize, it notifies
+the policy that a resize has completed (point H); finally, the element
+is inserted, and the policy notified (point I).
+</p>
+
+<h6 align = "center">
+<a name = "insert_resize_sequence_diagram1">
+<img src = "insert_resize_sequence_diagram1.jpg" width = "70%" alt = "no image">
+</a>
+</h6>
+<h6 align = "center">
+Insert resize sequence diagram.
+</h6>
+
+<p>
+ This addresses, to some extent, the problems mentioned above:
+</p>
+<ol>
+ <li>
+ Different instantiations of range-hashing policies can be met with different instantiations of
+ resize policies.
+ </li>
+ <li>
+ Questions on size-related interface are avoided, since the containers have no size-related methods. Thus
+ a container has no method for querying its actual size. It merely continuously forwards enough information to
+ its resize policy to answer such queries; the designer of the resize policy can decide whether, or how, to design the appropriate method. Also, a container has no methods for setting its size. It merely queries its
+resize policy for an initial size, queries it on a new size (if the resize policy indicates a resize is needed), and
+supports a <tt><b>protected virtual</b></tt> function for external resize.
+ </li>
+</ol>
+
+<p>
+ The library contains a single class for instantiating a resize policy,
+<tt>pb_assoc</tt> contains
+a standard resize policy,
+<a href = "ht_standard_resize_policy.html"><tt>ht_standard_resize_policy</tt></a> (the name is explained shortly).
+In terms of interface, it is parameterized by a boolean constant indicating whether its public interface supports
+queries of actual size and external resize operations (the inclusion and exclusion of these methods in the interface have obvious tradeoffs in terms of encapsulation and flexibility).
+([<a href = "references.html#alexandrescu01modern">alexandrescu01modern</a>] shows many techniques for
+changing between alternative interfaces at compile time.)
+</p>
+
+<p>
+As noted before,
+ size and trigger policies are usually orthogonal.
+<a href = "ht_standard_resize_policy.html"><tt>ht_standard_resize_policy</tt></a>
+is parameterized by size and trigger policies. For example,
+a collision-chaining hash table
+is typically be defined as follows:
+</p>
+<pre>
+cc_ht_map&lt;
+ key,
+ data,
+ ...
+ ht_standard_resize_policy&lt;
+ some_trigger_policy,
+ some_size_policy,
+ ...&gt; &gt;
+</pre>
+
+<p>
+ The sole function of
+<a href = "ht_standard_resize_policy.html"><tt>ht_standard_resize_policy</tt></a>
+ is to
+act as a standard delegator
+[<a href = "references.html#gamma95designpatterns">gamma95designpatterns</a>] for these
+policies.
+
+<p>
+ Figures
+<a href = "#insert_resize_sequence_diagram2">Standard resize policy trigger sequence diagram</a>
+ and
+<a href = "#insert_resize_sequence_diagram3">Standard resize policy size sequence diagram</a>
+ show sequence diagrams illustrating the interaction between
+ the standard resize policy and its trigger and size policies, respectively.
+</p>
+
+<h6 align = "center">
+<a name = "insert_resize_sequence_diagram2">
+<img src = "insert_resize_sequence_diagram2.jpg" width = "70%" alt = "no image">
+</a>
+</h6>
+<h6 align = "center">
+Standard resize policy trigger sequence diagram.
+</h6>
+
+<h6 align = "center">
+<a name = "insert_resize_sequence_diagram3">
+<img src = "insert_resize_sequence_diagram3.jpg" width = "70%" alt = "no image">
+</a>
+</h6>
+<h6 align = "center">
+Standard resize policy size sequence diagram.
+</h6>
+
+<p>
+ The library (currently) supports the following instantiations of size
+and trigger policies:
+</p>
+
+<ol>
+ <li>
+ <a href = "ht_load_check_trigger.html"><tt>ht_load_check_trigger</tt></a> implements
+ a load check trigger policy.
+ </li>
+ <li>
+ <a href = "ht_max_collision_check_grow_resize_trigger.html"><tt>ht_max_collision_check_grow_resize_trigger</tt></a>
+ implements a collision check trigger policy.
+ </li>
+ <li>
+<a href = "ht_exponential_size_policy.html"><tt>ht_exponential_size_policy</tt></a> implemens
+an exponential-size policy (which should be used with mask range hashing).
+ </li>
+ <li>
+<a href = "ht_prime_size_policy.html"><tt>ht_prime_size_policy</tt></a> implementing
+a size policy based on a sequence of primes
+[<a href = "references.html#sgi_stl">sgi_stl</a>] (which should be used with mod range hashing
+ </li>
+</ol>
+
+<p>
+ The trigger policies also support interfaces for changing their specifics which depend on compile time constants.
+</p>
+
+
+<p>
+ Figure
+<a href = "#resize_policy_cd">Resize policy class diagram</a> gives an overall picture
+of the resize-related classes.
+<tt>Container</tt> (which stands for any of the hash-based containers) is parameterized
+by <tt>Resize_Policy</tt>, from which it subclasses publicly
+[<a href = "references.html#alexandrescu01modern">alexandrescu01modern</a>].
+This class is currently instantiated only by
+<a href = "ht_standard_resize_policy.html"><tt>ht_standard_resize_policy</tt></a>.
+<a href = "ht_standard_resize_policy.html"><tt>ht_standard_resize_policy</tt></a> itself
+is parameterized by <tt>Trigger_Policy</tt> and <tt>Size_Policy</tt>.
+Currently, <tt>Trigger_Policy</tt> is instantiated by
+<a href = "ht_load_check_trigger.html"><tt>ht_load_check_trigger</tt></a>,
+or
+<a href = "ht_max_collision_check_grow_resize_trigger.html"><tt>ht_max_collision_check_grow_resize_trigger</tt></a>; <tt>Size_Policy</tt> is instantiated by
+<a href = "ht_exponential_size_policy.html"><tt>ht_exponential_size_policy</tt></a>,
+or
+<a href = "ht_prime_size_policy.html"><tt>ht_prime_size_policy</tt></a>.
+</p>
+
+
+<h6 align = "center">
+<a name = "resize_policy_cd">
+<img src = "resize_policy_cd.jpg" width = "70%" alt = "no image">
+</a>
+</h6>
+<h6 align = "center">
+Resize policy class diagram.
+</h6>
+
+
+
+
+<h2><a name = "#policy_interaction">Policy Interaction</a></h2>
+
+<p>
+ Hash-tables are unfortunately susceptible to choice of policies. One
+of the more complicated aspects of this is that poor combinations of good policies
+can alter performance drastically. Following are some considerations.
+</p>
+
+
+
+
+
+<h3>Range-Hashing Policies and Resize Policies</h3>
+
+<p>
+</p>
+
+
+<h3>Equivalence Functors, Storing Hash Values, and Hash Functions</h3>
+
+
+<p>
+<a href = "cc_hash_assoc_cntnr.html"><tt>cc_hash_assoc_cntnr</tt></a>
+and
+<a href = "gp_hash_assoc_cntnr.html"><tt>gp_hash_assoc_cntnr</tt></a>
+are parameterized by an equivalenc functor and by a <tt>Store_Hash</tt>
+parameter. If the latter parameter is <tt><b>true</b></tt>, then
+the container stores with each entry a hash value, and uses
+this value in case of collisions to determine whether to apply a hash value.
+This can lower the cost of collision for some types, but increase the cost of collisions for other types.
+</p>
+
+<p>
+ If a ranged-hash function or ranged probe function is directly supplied, however,
+then it makes no sense to store the hash value with each entry. <tt>pb_assoc</tt>'s container will fail at compilation, by design, if this is attempted.
+</p>
+
+
+
+</body>
+
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/hash_cd.jpg b/libstdc++-v3/docs/html/ext/pb_assoc/hash_cd.jpg
new file mode 100644
index 0000000..6c26a177
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/hash_cd.jpg
Binary files differ
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/hash_exponential_size_policy.html b/libstdc++-v3/docs/html/ext/pb_assoc/hash_exponential_size_policy.html
new file mode 100644
index 0000000..f0fc5a7
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/hash_exponential_size_policy.html
@@ -0,0 +1,267 @@
+
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+
+
+<html>
+<head>
+<title>hash_exponential_size_policy Interface
+</title>
+
+</head>
+
+<body>
+<h1>
+<tt>hash_exponential_size_policy
+</tt>
+
+ Interface
+
+
+</h1>
+
+<p>A size policy whose sequence of sizes form an exponential sequence (typically powers of 2)
+</p>
+
+<ol>
+<li>
+<a href = "../../../../include/ext/pb_assoc/hash_policy.hpp"><tt>hash_policy.hpp</tt>
+</a>
+
+</li>
+
+<li>
+<a href = "#link1">Template parameters.
+</a>
+
+</li>
+
+<li>
+Public Types and Constants:
+
+
+<ol>
+<li>
+<a href = "#link2">General definitions.
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+<li>
+Public Methods:
+
+
+<ol>
+<li>
+<a href = "#link3">Constructors, destructors, and related methods.
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+<li>
+Protected Methods:
+
+
+<ol>
+<li>
+<a href = "#link4">Size methods
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+</ol>
+
+
+<h2>
+<a name = "link1">Template parameters.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "20%" ALIGN = "left"><b>Parameter</b></TD><TD Width = "50%" ALIGN = "left"><b>Description</b></TD><TD Width = "30%" ALIGN = "left"><b>Default Value</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "Size_Type3735929483">Size_Type</a></pre>
+
+
+</td>
+
+<td>
+<p>Size type.</p>
+
+
+</td>
+
+<td>
+size_t
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link2">General definitions.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "30%" ALIGN = "left"><b>Type</b></TD><TD Width = "55%" ALIGN = "left"><b>Definition</b></TD><TD Width = "15%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "size_type3735929547">size_type</a></pre>
+
+
+</td>
+
+<td>
+<pre><a href = "#Size_Type3735929483">Size_Type</a></pre>
+
+
+</td>
+
+<td>
+<p>Size type.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link3">Constructors, destructors, and related methods.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre> hash_exponential_size_policy
+ (<a href = "#size_type3735929547">size_type</a> start_size = 8,
+ <a href = "#size_type3735929547">size_type</a> grow_factor = 2)</pre>
+
+
+</td>
+
+<td>
+<p>Default constructor, or onstructor taking a <font color = "#666666"><tt>start_size</tt></font>, a start size and <font color = "#666666"><tt>grow_factor</tt></font>, a growth factor. The policy will use the sequence of sizes <font color = "#666666"><tt>start_size</tt></font>, <font color = "#666666"><tt>start_size</tt></font> * <font color = "#666666"><tt>grow_factor</tt></font>, <font color = "#666666"><tt>start_size</tt></font> * <font color = "#666666"><tt>grow_factor</tt></font>^2, ...</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>void</b>
+ swap
+ (<font color = "olive">hash_exponential_size_policy</font> &amp;r_other)</pre>
+
+
+</td>
+
+<td>
+<p>Swaps content.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link4">Size methods
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a href = "#size_type3735929547">size_type</a>
+ get_init_size
+ (<a href = "#size_type3735929547">size_type</a> suggested_size) <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Given <font color = "#666666"><tt>suggested_size</tt></font>, a suggested size, returns an initial size of the container related to the initial size.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a href = "#size_type3735929547">size_type</a>
+ get_nearest_larger_size
+ (<a href = "#size_type3735929547">size_type</a> cur_size) <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Given <font color = "#666666"><tt>cur_size</tt></font>, the current size, returns a size that is larger.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a href = "#size_type3735929547">size_type</a>
+ get_nearest_smaller_size
+ (<a href = "#size_type3735929547">size_type</a> cur_size) <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Given <font color = "#666666"><tt>cur_size</tt></font>, the current size, returns a size that is smaller.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+
+
+</body>
+
+</html>
+
+
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/hash_fn.html b/libstdc++-v3/docs/html/ext/pb_assoc/hash_fn.html
new file mode 100644
index 0000000..6ef435b
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/hash_fn.html
@@ -0,0 +1,25 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+<html>
+<head>
+<title>Hash Functions</title>
+<meta name="GENERATOR" content="Microsoft Visual Studio .NET 7.1">
+<meta name="vs_targetSchema" content="http://schemas.microsoft.com/intellisense/ie5">
+</head>
+<body bgcolor = "white">
+<h1>Hash Functions</h1>
+
+<p>
+A hash function is essentially an <tt>std::unary_operator</tt>. It takes a
+<a href = "key_type_defs.html"><tt>const_key_reference</tt></a>, and returns
+a (non-negative) integral type.
+</p>
+
+<p>
+ A special hash function, <a href = "null_hash_fn.html"><tt>null_hash_fn</tt></a>
+serves to indicate that the <a href = "hash_policies.html">ranged-hash</a> function
+or <a href = "hash_policies.html">ranged-probe</a> function should not be formed by composition.
+</p>
+
+
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/hash_load_check_resize_trigger.html b/libstdc++-v3/docs/html/ext/pb_assoc/hash_load_check_resize_trigger.html
new file mode 100644
index 0000000..6670d69
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/hash_load_check_resize_trigger.html
@@ -0,0 +1,744 @@
+
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+
+
+<html>
+<head>
+<title>hash_load_check_resize_trigger Interface
+</title>
+
+</head>
+
+<body>
+<h1>
+<tt>hash_load_check_resize_trigger
+</tt>
+
+ Interface
+
+
+</h1>
+
+<p>A resize trigger policy based on a load check. It keeps the load factor between some load factors load_min and load_max.
+</p>
+
+<ol>
+<li>
+<a href = "../../../../include/ext/pb_assoc/hash_policy.hpp"><tt>hash_policy.hpp</tt>
+</a>
+
+</li>
+
+<li>
+<a href = "#link1">Template parameters.
+</a>
+
+</li>
+
+<li>
+Public Types and Constants:
+
+
+<ol>
+<li>
+<a href = "#link2">General definitions.
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+<li>
+Public Methods:
+
+
+<ol>
+<li>
+<a href = "#link3">Constructors, destructor, and related.
+</a>
+
+</li>
+
+<li>
+<a href = "#link4">Load access methods.
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+<li>
+Protected Methods:
+
+
+<ol>
+<li>
+<a href = "#link5">Insert search notifications.
+</a>
+
+</li>
+
+<li>
+<a href = "#link6">Find search notifications.
+</a>
+
+</li>
+
+<li>
+<a href = "#link7">Erase search notifications.
+</a>
+
+</li>
+
+<li>
+<a href = "#link8">Content change notifications.
+</a>
+
+</li>
+
+<li>
+<a href = "#link9">Size change notifications.
+</a>
+
+</li>
+
+<li>
+<a href = "#link10">Queries.
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+</ol>
+
+
+<h2>
+<a name = "link1">Template parameters.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "20%" ALIGN = "left"><b>Parameter</b></TD><TD Width = "50%" ALIGN = "left"><b>Description</b></TD><TD Width = "30%" ALIGN = "left"><b>Default Value</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "External_Load_Access3735929540">External_Load_Access</a></pre>
+
+
+</td>
+
+<td>
+<p>Specifies whether the load factor can be accessed externally. The two options have different tradeoffs in terms of flexibility, genericity, and encapsulation.</p>
+
+
+</td>
+
+<td>
+<tt><b>false</b></tt>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "Size_Type3735929483">Size_Type</a></pre>
+
+
+</td>
+
+<td>
+<p>Size type.</p>
+
+
+</td>
+
+<td>
+size_t
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link2">General definitions.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "30%" ALIGN = "left"><b>Type</b></TD><TD Width = "55%" ALIGN = "left"><b>Definition</b></TD><TD Width = "15%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "size_type3735929547">size_type</a></pre>
+
+
+</td>
+
+<td>
+<pre><a href = "#Size_Type3735929483">Size_Type</a></pre>
+
+
+</td>
+
+<td>
+<p>Size type.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "external_load_access3735929604">external_load_access</a></pre>
+
+
+</td>
+
+<td>
+<pre><a href = "#External_Load_Access3735929540">External_Load_Access</a></pre>
+
+
+</td>
+
+<td>
+<p>Indicates whether loads can be accessed externally</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link3">Constructors, destructor, and related.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre> hash_load_check_resize_trigger
+ (float load_min = 0.125,
+ float load_max = 0.5)</pre>
+
+
+</td>
+
+<td>
+<p>Default constructor, or constructor taking <font color = "#666666"><tt>load_min</tt></font> and <font color = "#666666"><tt>load_max</tt></font> load factors between which this policy will keep the actual load.</p>
+
+
+<p>It is the responsibility of the user to ensure that <font color = "#666666"><tt>load_min</tt></font> is smaller than <font color = "#666666"><tt>load_max</tt></font>.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>void</b>
+ swap
+ (<font color = "olive">hash_load_check_resize_trigger</font> &amp;r_other)</pre>
+
+
+</td>
+
+<td>
+<p>Swaps content.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre> <b>virtual</b>
+ ~hash_load_check_resize_trigger
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Destructor.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link4">Load access methods.
+</a>
+
+</h2>
+
+<p> These methods are only available if the external access parameter is set.</p>
+
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>inline</b> std::pair&lt;float, float&gt;
+ get_loads
+ () <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Returns a pair of the minimal and maximal loads, respectively.</p>
+
+
+<p>Calling this method will not compile when <a href = "#External_Load_Access3735929540"><tt>External_Load_Access</tt></a> == <tt><b>false</b></tt>.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>void</b>
+ set_loads
+ (std::pair&lt;float, float&gt; load_pair)</pre>
+
+
+</td>
+
+<td>
+<p>Sets the loads through a pair of the minimal and maximal loads, respectively.</p>
+
+
+<p>Calling this method resizes the container, and might throw an exception. It is the responsibility of the user to pass appropriate loads to this function. Calling this method will not compile when <a href = "#External_Load_Access3735929540"><tt>External_Load_Access</tt></a> == <tt><b>false</b></tt>.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link5">Insert search notifications.
+</a>
+
+</h2>
+
+<p>Notifications called during an insert operation.</p>
+
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>inline</b> <b>void</b>
+ notify_insert_search_start
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Notifies a search started.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <b>void</b>
+ notify_insert_search_collision
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Notifies a search encountered a collision.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <b>void</b>
+ notify_insert_search_end
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Notifies a search ended.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link6">Find search notifications.
+</a>
+
+</h2>
+
+<p>Notifications called during a find operation.</p>
+
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>inline</b> <b>void</b>
+ notify_find_search_start
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Notifies a search started.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <b>void</b>
+ notify_find_search_collision
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Notifies a search encountered a collision.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <b>void</b>
+ notify_find_search_end
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Notifies a search ended.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link7">Erase search notifications.
+</a>
+
+</h2>
+
+<p>Notifications called during an insert operation.</p>
+
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>inline</b> <b>void</b>
+ notify_erase_search_start
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Notifies a search started.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <b>void</b>
+ notify_erase_search_collision
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Notifies a search encountered a collision.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <b>void</b>
+ notify_erase_search_end
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Notifies a search ended.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link8">Content change notifications.
+</a>
+
+</h2>
+
+<p>Notifications called when the content of the table changes in a way that can affect the resize policy.</p>
+
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>inline</b> <b>void</b>
+ notify_inserted
+ (<a href = "#size_type3735929547">size_type</a> num_entries)</pre>
+
+
+</td>
+
+<td>
+<p>Notifies an element was inserted. the total number of entries in the table is <font color = "#666666"><tt>num_entries</tt></font>.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <b>void</b>
+ notify_erased
+ (<a href = "#size_type3735929547">size_type</a> num_entries)</pre>
+
+
+</td>
+
+<td>
+<p>Notifies an element was erased.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>void</b>
+ notify_cleared
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Notifies the table was cleared.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link9">Size change notifications.
+</a>
+
+</h2>
+
+<p>Notifications called when the table changes size.</p>
+
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>void</b>
+ notify_resized
+ (<a href = "#size_type3735929547">size_type</a> new_size)</pre>
+
+
+</td>
+
+<td>
+<p>Notifies the table was resized as a result of this object's signifying that a resize is needed.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>void</b>
+ notify_externally_resized
+ (<a href = "#size_type3735929547">size_type</a> new_size)</pre>
+
+
+</td>
+
+<td>
+<p>Notifies the table was resized externally.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link10">Queries.
+</a>
+
+</h2>
+
+<p>Called to query whether/how to resize.</p>
+
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>inline</b> <b>bool</b>
+ is_resize_needed
+ () <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Queries whether a resize is needed.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <b>bool</b>
+ is_grow_needed
+ (<a href = "#size_type3735929547">size_type</a> size,
+ <a href = "#size_type3735929547">size_type</a> num_entries) <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Queries whether a grow is needed.</p>
+
+
+<p>This method is called only if this object indicated resize is needed. The actual <font color = "#666666"><tt>size</tt></font> of the table is <font color = "#666666"><tt>size</tt></font>, and the number of entries in it is <font color = "#666666"><tt>num_entries</tt></font>.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <b>bool</b>
+ is_shrink_needed
+ (<a href = "#size_type3735929547">size_type</a> size,
+ <a href = "#size_type3735929547">size_type</a> num_entries) <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Queries whether a shrink is needed.</p>
+
+
+<p>This method is called only if this object indicated resize is needed. The actual <font color = "#666666"><tt>size</tt></font> of the table is <font color = "#666666"><tt>size</tt></font>, and the number of entries in it is <font color = "#666666"><tt>num_entries</tt></font>.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+
+
+</body>
+
+</html>
+
+
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/hash_policies.html b/libstdc++-v3/docs/html/ext/pb_assoc/hash_policies.html
new file mode 100644
index 0000000..c5bc2aa
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/hash_policies.html
@@ -0,0 +1,375 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+<html>
+<head>
+ <title>Hash Policies</title>
+ <meta name="GENERATOR" content="Microsoft Visual Studio .NET 7.1">
+ <meta name="vs_targetSchema" content="http://schemas.microsoft.com/intellisense/ie5">
+</head>
+<body bgcolor="white">
+
+<h1>Hash Policies</h1>
+<p>
+ This subsection describes hash policies. It is organized as follows:
+</p>
+<ol>
+ <li> The <a href = "#general_terms">General Terms</a> Section describes
+ some general terms.
+ </li>
+ <li> The <a href = "#range_hashing_fns">Range-Hashing Functions</a> Section
+ describes range-hasing functions.</li>
+ <li> The <a href = "#hash_policies_ranged_hash_policies">Ranged-Hash Functions</a> Section
+ describes ranged-hash functions. </li>
+ <li> The <a href = "#pb_assoc_imp">Implementation in <tt>pb_assoc</tt></a> Section
+ describes the implementation of these concepts in <tt>pb_assoc</tt>.
+ </li>
+</ol>
+
+
+<h2><a name="general_terms">General Terms</a></h2>
+
+<p>
+ There
+are actually three functions involved in transforming a key into a hash-table's
+position (see Figure
+<a href = "#hash_ranged_hash_range_hashing_fns">
+Hash runctions, ranged-hash functions, and range-hashing functions
+</a>):
+</p>
+<ol>
+ <li>
+ A <i>ranged-hash</i> function, which maps keys into an interval of the
+ non-negative integrals. This is the function actually required by the
+ hash-table algorithm.
+ </li>
+ <li>
+ A hash function, which maps keys into non-negative integral types. This is
+ typically specified by the writer of the key class.
+ </li>
+ <li>
+ A <i>range-hashing</i> function, which maps non-negative integral types into an
+ interval of non-negative integral types.
+ </li>
+</ol>
+
+<h6 align = "center">
+<a name = "hash_ranged_hash_range_hashing_fns">
+<img src = "hash_ranged_hash_range_hashing_fns.jpg" width = "40%" alt = "no image">
+</a>
+Hash runctions, ranged-hash functions, and range-hashing functions.
+</h6>
+
+<p>
+ Let <i>U</i> be a domain (<i>e.g.</i>, the integers, or the strings of 3
+ characters). A hash-table algorithm needs to map elements of <i>U</i> "uniformly"
+ into the range <i>[0,..., m - 1]</i> (where <i>m</i> is a non-negative integral
+ value, and is, in general, time varying). <i>I.e.</i>, the algorithm needs a <i>ranged-hash</i>
+ function
+</p>
+<p>
+ <i>f : U &times; Z<sub>+</sub> &rarr; Z<sub>+</sub> </i>,
+</p>
+<p>
+ such that for any <i>u</i> in <i>U</i>
+,
+</p>
+<p>
+ <i>0 &le; f(u, m) &le; m - 1 </i>,
+</p>
+<p>
+ and which has "good uniformity" properties [<a href="references.html#knuth98sorting">knuth98sorting</a>].
+ One common solution is to use the composition of the hash function
+</p>
+<p>
+ <i>h : U &rarr; Z<sub>+</sub> </i>,
+</p>
+<p>
+ which maps elements of <i>U</i> into the non-negative integrals, and
+</p>
+<p>
+ <i>g : Z<sub>+</sub> &times; Z<sub>+</sub> &rarr; Z<sub>+</sub>, </i>
+</p>
+<p>
+ which maps a non-negative hash value, and a non-negative range upper-bound into
+ a non-negative integral in the range between 0 (inclusive) and the range upper
+ bound (exclusive), <i>i.e.</i>, for any <i>r</i> in <i>Z<sub>+</sub></i>,
+</p>
+<p>
+ <i>0 &le; g(r, m) &le; m - 1 </i>.
+</p>
+<p>
+ The resulting ranged-hash function, is
+</p>
+<p>
+ <i><a name="eqn:ranged_hash_composed_of_hash_and_range_hashing">f(u , m) = g(h(u), m) </a>
+ </i>(1) .
+</p>
+
+<p>
+ From the above, it is obvious that given <i>g</i> and <i>h</i>, <i>f</i> can
+ always be composed (however the converse is not true).
+</p>
+
+
+<p>
+ The above describes the case where a key is to be mapped into a <i>single
+position</i> within a hash table, <i>e.g.</i>, in a collision-chaining table.
+In other cases, a key is to be mapped into a <i>sequence of poisitions</i>
+within a table, <i>e.g.</i>, in a probing table.
+</p>
+<p>
+ Similar terms apply in this case: the table requires a <i>ranged probe</i>
+function, mapping a key into a sequence of positions withing the table. This is
+typically acheived by composing a <i>hash function</i> mapping the key
+into a non-negative integral type, a <i>probe</i> function transforming the
+hash value into a sequence of hash values, and a <i>range-hashing</i> function
+transforming the sequence of hash values into a sequence of positions.
+</p>
+
+
+<h2><a name="range_hashing_fns">Range-Hashing Functions</a></h2>
+
+<p>
+ Some common choices for range-hashing functions are the division,
+ multiplication, and middle-square methods [<a href="references.html#knuth98sorting">knuth98sorting</a>],
+ defined as
+</p>
+<p>
+ <i><a name="eqn:division_method">g(r, m) = r mod m </a></i>(2) ,
+</p>
+<p>
+ <i>g(r, m) = &lceil; u/v ( a r mod v ) &rceil; </i>,
+</p>
+<p>
+ and
+</p>
+<p>
+ <i>g(r, m) = &lceil; u/v ( r<sup>2</sup> mod v ) &rceil; </i>,
+</p>
+<p>
+respectively, for some positive integrals <i>u</i> and <i>v</i> (typically
+powers of 2), and some <i>a</i>. Each of these range-hashing functions works
+best for some different setting.
+</p>
+<p>
+ The division method <a href="#division_method">(2)</a> is a very common
+ choice. However, even this single method can be implemented in two very
+ different ways. It is possible to implement <a href="#division_method">(2)</a>
+ using the low level <i>%</i> (modulo) operation (for any <i>m</i>), or the low
+ level <i>&amp;</i> (bit-mask) operation (for the case where <i>m</i> is a power of
+ 2), <i>i.e.</i>,
+</p>
+<p>
+ <i><a name="eqn:division_method_prime_mod">g(r, m) = r % m </a></i>(3) ,
+</p>
+<p>
+ and
+</p>
+<p>
+ <a name="eqn:division_method_bit_mask">
+ <i>g(r, m) = r &amp; m - 1, ( m = 2<sup>k</sup>
+ </i>
+ for some<i> k) </i></a>(4) ,
+</p>
+<p>
+ respectively.
+</p>
+<p>
+ The <i>%</i> (modulo) implementation <a href="#division_method_prime_mod">(3)</a>
+ has the advantage that for <i>m</i> a prime far from a power of 2, <i>g(r, m)</i>
+ is affected by all the bits of <i>r</i> (minimizing the chance of collision).
+ It has the disadvantage of using the costly modulo operation. This method is
+ hard-wired into SGI's implementation [<a href="references.html#sgi_stl">sgi_stl</a>].
+</p>
+
+<p>
+ The <i>&amp;</i> (bit-mask) implementation <a href="#division_method_bit_mask">(4)</a>
+ has the advantage of relying on the fast bitwise and operation. It has the
+ disadvantage that for <i>g(r, m)</i> is affected only by the low order bits of <i>r</i>.
+ This method is hard-wired into Dinkumware's implementation [<a href="references.html#dinkumware_stl">dinkumware_stl</a>].
+</p>
+
+
+
+
+<h2><a name="hash_policies_ranged_hash_policies">Ranged-Hash Functions</a></h2>
+
+<p>
+ Although rarer, there are cases where it is beneficial to allow the client to
+directly specify a ranged-hash hash function. It is true, that the writer of
+the ranged-hash function cannot rely on the values of <i>m</i> having specific
+numerical properties suitable for hashing (in the sense used in [<a href="references.html#knuth98sorting">knuth98sorting</a>]),
+since the values of <i>m</i> are determined by a resize policy with possibly
+orthogonal considerations [<a href="references.html#austern98segmented">austern98segmented</a>].
+The values of <i>m</i> can be used in some cases, though, to estimate the
+"general" number of distinct values required.
+</p>
+
+<p>
+ Let
+</p>
+
+<p>
+ <i>s = [ s<sub>0</sub>,..., s<sub>t - 1</sub>] </i>
+</p>
+
+<p>
+ be a string of <i>t</i> characters, each of which is from domain <i>S</i>.
+Consider the following ranged-hash function:
+</p>
+
+<p>
+ <a name="eqn:total_string_dna_hash">
+ <i>
+ f<sub>1</sub>(s, m) =
+ &sum; <sub>i =
+ 0</sub><sup>t - 1</sup> s<sub>i</sub> a<sup>i</sup> </i>mod<i> m </i>
+ </a> (5) ,
+</p>
+
+<p>
+ where <i>a</i> is some non-negative integral value. This is the standard
+string-hashing function used in SGI's implementation (with <i>a = 5</i>) [<a href="references.html#sgi_stl">sgi_stl</a>].
+Its advantage is that it takes into account all of the characters of the
+string.
+</p>
+
+<p>
+ Now assume that <i>s</i> is the string representation of a of a long DNA
+sequence (and so <i>S = {'A', 'C', 'G', 'T'}</i>). In this case, scanning the
+entire string might be prohibitively expensive. A possible alternative might be
+to use only the first <i>k</i> characters of the string, where
+</p>
+
+<p>
+ k <sup>|S|</sup> &ge; m ,
+</p>
+<p>
+ <i>i.e.</i>, using the hash function
+</p>
+<p>
+ <a name="eqn:only_k_string_dna_hash"><i>f<sub>2</sub>(s, m) = &sum; <sub>i = 0</sub><sup>k
+ - 1</sup> s<sub>i</sub> a<sup>i</sup> </i>mod <i>m </i></a>, (6)
+</p>
+<p>
+ requiring scanning over only
+</p>
+<p>
+ <i>k = </i>log<i><sub>4</sub>( m ) </i>
+</p>
+<p>
+ characters.
+</p>
+<p>
+ Other more elaborate hash-functions might scan <i>k</i> characters starting at
+ a random position (determined at each resize), or scanning <i>k</i> random
+ positions (determined at each resize), <i>i.e.</i>, using
+</p>
+<p>
+ <i>f<sub>3</sub>(s, m) = &sum; <sub>i = r<sub>0</sub></sub><sup>r<sub>0</sub> + k - 1</sup>
+ s<sub>i</sub> a<sup>i</sup> </i>mod <i>m </i>,
+</p>
+<p>
+ or
+</p>
+<p>
+ <i>f<sub>4</sub>(s, m) = &sum; <sub>i = 0</sub><sup>k - 1</sup> s<sub>r<sub>i</sub></sub>
+ a<sup>r<sub>i</sub></sup> </i>mod <i>m </i>,
+</p>
+<p>
+<p>
+ respectively, for <i>r<sub>0</sub>,..., r<sub>k-1</sub></i> each in the
+ (inclusive) range <i>[0,...,t-1]</i>.
+</p>
+
+
+<h2><a name="pb_assoc_imp">Implementation in <tt>pb_assoc</tt></a></h2>
+
+<p>
+ Containers based on collision-chaining hash tables in <tt>pb_assoc</tt>
+are parameterized by the functors <tt>Hash_Fn</tt>, and <tt>Comb_Hash_Fn</tt>.
+</p>
+
+<p>
+ If such a container is instantiated with any hash functor and
+range-hashing functor, the container will synthesize a ranged-hash functor
+automatically. For example, Figure
+<a href = "#hash_range_hashing_seq_diagram">
+Insert hash sequence diagram
+</a>
+shows an <tt>insert</tt> sequence diagram. The user inserts an element (point A),
+the container transforms the key into a non-negative integral using the hash
+functor (points B and C), and transforms the result into a position
+using the combining functor (points D and E).
+</p>
+
+<h6 align = "center">
+<a name = "hash_range_hashing_seq_diagram">
+<img src = "hash_range_hashing_seq_diagram.jpg" width = "50%" alt = "no image">
+</a>
+</h6>
+<h6 align = "center">
+Insert hash sequence diagram.
+</h6>
+
+
+<p>
+ If such a container is instantiated with the
+<a href = "concepts.html#concepts_null_policies">null policy</a>
+hash functor,
+<a href = "null_hash_fn.html"><tt>null_hash_fn</tt></a>,
+and a combining-hash functor, the container treats
+the combining hash functor as a ranged-hash function. For example, Figure
+<a href = "#hash_range_hashing_seq_diagram2">
+Insert hash sequence diagram with a null combination policy
+</a>
+shows an <tt>insert</tt> sequence diagram. The user inserts an element (point A),
+the container transforms the key into a position
+using the combining functor (points B and C).
+</p>
+
+
+<h6 align = "center">
+<a name = "hash_range_hashing_seq_diagram2">
+<img src = "hash_range_hashing_seq_diagram2.jpg" width = "50%" alt = "no image">
+</a>
+</h6>
+<h6 align = "center">
+Insert hash sequence diagram with a null combination policy.
+</h6>
+
+<p>
+ <tt>pb_assoc</tt> contains the following hash-related policies:
+</p>
+
+<ol>
+ <li>
+<a href = "direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+and
+<a href = "direct_mod_range_hashing.html"><tt>direct_mod_range_hashing</tt></a>
+are range-hashing functions based on a bit-mask and a modulo operation, respectively.
+ </li>
+ <li>
+<a href = "linear_probe_fn.html"><tt>linear_probe_fn</tt></a> and
+<a href = "quadratic_probe_fn.html"><tt>quadratic_probe_fn</tt></a> are probe
+classes based on linear and quadratic increment, respectively.
+ </li>
+ <li>
+<a href = "null_hash_fn.html"><tt>null_hash_fn</tt></a>
+and
+<a href = "null_probe_fn.html"><tt>null_probe_fn</tt></a>
+are
+<a href = "concepts.html#concepts_null_policies">null policy classes</a> for creating
+ranged-hash and ranged-probe functions directly (<i>i.e.</i>, not through
+composition).
+ </li>
+</ol>
+
+<p>
+ <tt>pb_assoc</tt> does not provide any hash functions (it relies on those
+of the STL).
+</p>
+
+
+</body>
+
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/hash_policy_cd.jpg b/libstdc++-v3/docs/html/ext/pb_assoc/hash_policy_cd.jpg
new file mode 100644
index 0000000..c5d2290
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/hash_policy_cd.jpg
Binary files differ
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/hash_prime_size_policy.html b/libstdc++-v3/docs/html/ext/pb_assoc/hash_prime_size_policy.html
new file mode 100644
index 0000000..5b6d0ac
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/hash_prime_size_policy.html
@@ -0,0 +1,211 @@
+
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+
+
+<html>
+<head>
+<title>hash_prime_size_policy Interface
+</title>
+
+</head>
+
+<body>
+<h1>
+<tt>hash_prime_size_policy
+</tt>
+
+ Interface
+
+
+</h1>
+
+<p>A size policy whose sequence of sizes form a nearly-exponential sequence of primes.
+</p>
+
+<ol>
+<li>
+<a href = "../../../../include/ext/pb_assoc/hash_policy.hpp"><tt>hash_policy.hpp</tt>
+</a>
+
+</li>
+
+<li>
+Public Types and Constants:
+
+
+<ol>
+<li>
+<a href = "#link1">General definitions.
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+<li>
+Public Methods:
+
+
+<ol>
+<li>
+<a href = "#link2">Constructors, destructor, and related.
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+<li>
+Protected Methods:
+
+
+<ol>
+<li>
+<a href = "#link3">Size methods
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+</ol>
+
+
+<h2>
+<a name = "link1">General definitions.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "30%" ALIGN = "left"><b>Type</b></TD><TD Width = "55%" ALIGN = "left"><b>Definition</b></TD><TD Width = "15%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "size_type3735929547">size_type</a></pre>
+
+
+</td>
+
+<td>
+<pre>size_t</pre>
+
+
+</td>
+
+<td>
+<p>Size type.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link2">Constructors, destructor, and related.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>inline</b> <b>void</b>
+ swap
+ (<font color = "olive">hash_prime_size_policy</font> &amp;r_other)</pre>
+
+
+</td>
+
+<td>
+<p>Swaps content.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link3">Size methods
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>inline</b> <a href = "#size_type3735929547">size_type</a>
+ get_init_size
+ (<a href = "#size_type3735929547">size_type</a> suggested_size) <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Given <font color = "#666666"><tt>suggested_size</tt></font>, a suggested size, returns an initial size of the container related to the initial size.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <a href = "#size_type3735929547">size_type</a>
+ get_nearest_larger_size
+ (<a href = "#size_type3735929547">size_type</a> cur_size) <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Given <font color = "#666666"><tt>cur_size</tt></font>, the current size, returns a size that is larger.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <a href = "#size_type3735929547">size_type</a>
+ get_nearest_smaller_size
+ (<a href = "#size_type3735929547">size_type</a> cur_size) <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Given <font color = "#666666"><tt>cur_size</tt></font>, the current size, returns a size that is smaller.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+
+
+</body>
+
+</html>
+
+
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/hash_range_hashing_seq_diagram.jpg b/libstdc++-v3/docs/html/ext/pb_assoc/hash_range_hashing_seq_diagram.jpg
new file mode 100644
index 0000000..f675cea
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/hash_range_hashing_seq_diagram.jpg
Binary files differ
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/hash_range_hashing_seq_diagram2.jpg b/libstdc++-v3/docs/html/ext/pb_assoc/hash_range_hashing_seq_diagram2.jpg
new file mode 100644
index 0000000..a292d5a
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/hash_range_hashing_seq_diagram2.jpg
Binary files differ
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/hash_ranged_hash_range_hashing_fns.jpg b/libstdc++-v3/docs/html/ext/pb_assoc/hash_ranged_hash_range_hashing_fns.jpg
new file mode 100644
index 0000000..ba5f6cd
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/hash_ranged_hash_range_hashing_fns.jpg
Binary files differ
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/hash_standard_resize_policy.html b/libstdc++-v3/docs/html/ext/pb_assoc/hash_standard_resize_policy.html
new file mode 100644
index 0000000..0735dad
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/hash_standard_resize_policy.html
@@ -0,0 +1,986 @@
+
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+
+
+<html>
+<head>
+<title>hash_standard_resize_policy Interface
+</title>
+
+</head>
+
+<body>
+<h1>
+<tt>hash_standard_resize_policy
+</tt>
+
+ Interface
+
+
+</h1>
+
+<p>A resize policy which delegates operations to size and trigger policies.
+</p>
+
+<ol>
+<li>
+<a href = "../../../../include/ext/pb_assoc/hash_policy.hpp"><tt>hash_policy.hpp</tt>
+</a>
+
+</li>
+
+<li>
+<a href = "#link1">Template parameters.
+</a>
+
+</li>
+
+<li>
+<a href = "#link2">Base classes.
+</a>
+
+</li>
+
+<li>
+Public Types and Constants:
+
+
+<ol>
+<li>
+<a href = "#link3">General definitions.
+</a>
+
+</li>
+
+<li>
+<a href = "#link4">Policy definitions.
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+<li>
+Public Methods:
+
+
+<ol>
+<li>
+<a href = "#link5">Constructors, destructor, and related.
+</a>
+
+</li>
+
+<li>
+<a href = "#link6">Policy access methods.
+</a>
+
+</li>
+
+<li>
+<a href = "#link7">Size access methods.
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+<li>
+Protected Methods:
+
+
+<ol>
+<li>
+<a href = "#link8">Insert search notifications.
+</a>
+
+</li>
+
+<li>
+<a href = "#link9">Find search notifications.
+</a>
+
+</li>
+
+<li>
+<a href = "#link10">Erase search notifications.
+</a>
+
+</li>
+
+<li>
+<a href = "#link11">Content change notifications.
+</a>
+
+</li>
+
+<li>
+<a href = "#link12">Size change notifications.
+</a>
+
+</li>
+
+<li>
+<a href = "#link13">Queries.
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+</ol>
+
+
+<h2>
+<a name = "link1">Template parameters.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "20%" ALIGN = "left"><b>Parameter</b></TD><TD Width = "50%" ALIGN = "left"><b>Description</b></TD><TD Width = "30%" ALIGN = "left"><b>Default Value</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "Size_Policy3735929689">Size_Policy</a></pre>
+
+
+</td>
+
+<td>
+<p>Size policy type.</p>
+
+
+</td>
+
+<td>
+<a href = "hash_exponential_size_policy.html"><tt>hash_exponential_size_policy&lt;&gt;</tt></a>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "Trigger_Policy3735930002">Trigger_Policy</a></pre>
+
+
+</td>
+
+<td>
+<p>Trigger policy type.</p>
+
+
+</td>
+
+<td>
+<a href = "ht_load_check_trigger.html"><tt>ht_load_check_trigger&lt;&gt;</tt></a>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "External_Size_Access3735929535">External_Size_Access</a></pre>
+
+
+</td>
+
+<td>
+<p>Indicates whether physical sizes can be accessed externally.</p>
+
+
+</td>
+
+<td>
+<tt><b>false</b></tt>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "Size_Type3735929483">Size_Type</a></pre>
+
+
+</td>
+
+<td>
+<p>Size type.</p>
+
+
+</td>
+
+<td>
+size_t
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link2">Base classes.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "80%" ALIGN = "left"><b>Class</b></TD><TD Width = "20%" ALIGN = "left"><b>Derivation Type</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a href = "#Size_Policy3735929689">Size_Policy</a></pre>
+
+
+</td>
+
+<td>
+<p>public</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a href = "#Trigger_Policy3735930002">Trigger_Policy</a></pre>
+
+
+</td>
+
+<td>
+<p>public</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link3">General definitions.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "30%" ALIGN = "left"><b>Type</b></TD><TD Width = "55%" ALIGN = "left"><b>Definition</b></TD><TD Width = "15%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "size_type3735929547">size_type</a></pre>
+
+
+</td>
+
+<td>
+<pre><a href = "#Size_Type3735929483">Size_Type</a></pre>
+
+
+</td>
+
+<td>
+<p>Size type.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link4">Policy definitions.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "30%" ALIGN = "left"><b>Type</b></TD><TD Width = "55%" ALIGN = "left"><b>Definition</b></TD><TD Width = "15%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "trigger_policy3735930066">trigger_policy</a></pre>
+
+
+</td>
+
+<td>
+<pre><a href = "#Trigger_Policy3735930002">Trigger_Policy</a></pre>
+
+
+</td>
+
+<td>
+<p>Trigger policy type.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "size_policy3735929753">size_policy</a></pre>
+
+
+</td>
+
+<td>
+<pre><a href = "#Size_Policy3735929689">Size_Policy</a></pre>
+
+
+</td>
+
+<td>
+<p>Size policy type.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "external_size_access3735929599">external_size_access</a></pre>
+
+
+</td>
+
+<td>
+<pre><a href = "#External_Size_Access3735929535">External_Size_Access</a></pre>
+
+
+</td>
+
+<td>
+<p>Indicates whether sizes can be accessed externally.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link5">Constructors, destructor, and related.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre> hash_standard_resize_policy
+ (<a href = "#size_type3735929547">size_type</a> suggested_size = 8)</pre>
+
+
+</td>
+
+<td>
+<p>Default constructor, or constructor taking <font color = "#666666"><tt>suggested_size</tt></font>, a suggested size (the actual size will be determined by the <a href = "#Size_Policy3735929689"><tt>Size_Policy</tt></a> object).</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre> hash_standard_resize_policy
+ (<b>const</b> <a href = "#Size_Policy3735929689">Size_Policy</a> &amp;r_size_policy,
+ <a href = "#size_type3735929547">size_type</a> suggested_size = 8)</pre>
+
+
+</td>
+
+<td>
+<p>constructor taking some policies and <font color = "#666666"><tt>suggested_size</tt></font>, a suggested size (the actual size will be determined by the <a href = "#Size_Policy3735929689"><tt>Size_Policy</tt></a> object). <font color = "#666666"><tt>r_size_policy</tt></font> will be copied by the <a href = "#Size_Policy3735929689"><tt>Size_Policy</tt></a> object of this object.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre> hash_standard_resize_policy
+ (<b>const</b> <a href = "#Size_Policy3735929689">Size_Policy</a> &amp;r_size_policy,
+ <b>const</b> <a href = "#Trigger_Policy3735930002">Trigger_Policy</a> &amp;r_trigger_policy,
+ <a href = "#size_type3735929547">size_type</a> suggested_size = 8)</pre>
+
+
+</td>
+
+<td>
+<p>constructor taking some policies and <font color = "#666666"><tt>suggested_size</tt></font>, a suggested size (the actual size will be determined by the <a href = "#Size_Policy3735929689"><tt>Size_Policy</tt></a> object). <font color = "#666666"><tt>r_size_policy</tt></font> will be copied by the <a href = "#Size_Policy3735929689"><tt>Size_Policy</tt></a> object of this object. <font color = "#666666"><tt>r_trigger_policy</tt></font> will be copied by the <a href = "#Trigger_Policy3735930002"><tt>Trigger_Policy</tt></a> object of this object.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>virtual</b>
+ ~hash_standard_resize_policy
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Destructor.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <b>void</b>
+ swap
+ (<font color = "olive">hash_standard_resize_policy</font> &amp;r_other)</pre>
+
+
+</td>
+
+<td>
+<p>Swaps content.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link6">Policy access methods.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a href = "#Size_Policy3735929689">Size_Policy</a> &amp;
+ get_size_policy
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Access to the <a href = "#Size_Policy3735929689"><tt>Size_Policy</tt></a> object used.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>const</b> <a href = "#Size_Policy3735929689">Size_Policy</a> &amp;
+ get_size_policy
+ () <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Const access to the <a href = "#Size_Policy3735929689"><tt>Size_Policy</tt></a> object used.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a href = "#Trigger_Policy3735930002">Trigger_Policy</a> &amp;
+ get_trigger_policy
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Access to the <a href = "#Trigger_Policy3735930002"><tt>Trigger_Policy</tt></a> object used.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>const</b> <a href = "#Trigger_Policy3735930002">Trigger_Policy</a> &amp;
+ get_trigger_policy
+ () <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Access to the <a href = "#Trigger_Policy3735930002"><tt>Trigger_Policy</tt></a> object used.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link7">Size access methods.
+</a>
+
+</h2>
+
+<p>These methods are available only if the external size parameter indicates that external size access is allowed.</p>
+
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>inline</b> <a href = "#size_type3735929547">size_type</a>
+ get_actual_size
+ () <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Returns the actual size of the container.</p>
+
+
+<p>This method returns the number of entries (used and unused) in the container. It is different from the container's size method, which returns the number of used entries. Calling this method will not compile when <a href = "#External_Size_Access3735929535"><tt>External_Size_Access</tt></a> == <tt><b>false</b></tt>.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>void</b>
+ resize
+ (<a href = "#size_type3735929547">size_type</a> suggested_new_size)</pre>
+
+
+</td>
+
+<td>
+<p>Resizes the container to <font color = "#666666"><tt>suggested_new_size</tt></font>, a suggested size (the actual size will be determined by the <a href = "#Size_Policy3735929689"><tt>Size_Policy</tt></a> object).</p>
+
+
+<p>Calling this method will not compile when <a href = "#External_Size_Access3735929535"><tt>External_Size_Access</tt></a> == <tt><b>false</b></tt>.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link8">Insert search notifications.
+</a>
+
+</h2>
+
+<p>Notifications called during an insert operation.</p>
+
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>inline</b> <b>void</b>
+ notify_insert_search_start
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Notifies a search started.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <b>void</b>
+ notify_insert_search_collision
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Notifies a search encountered a collision.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <b>void</b>
+ notify_insert_search_end
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Notifies a search ended.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link9">Find search notifications.
+</a>
+
+</h2>
+
+<p>Notifications called during a find operation.</p>
+
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>inline</b> <b>void</b>
+ notify_find_search_start
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Notifies a search started.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <b>void</b>
+ notify_find_search_collision
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Notifies a search encountered a collision.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <b>void</b>
+ notify_find_search_end
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Notifies a search ended.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link10">Erase search notifications.
+</a>
+
+</h2>
+
+<p>Notifications called during an insert operation.</p>
+
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>inline</b> <b>void</b>
+ notify_erase_search_start
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Notifies a search started.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <b>void</b>
+ notify_erase_search_collision
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Notifies a search encountered a collision.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <b>void</b>
+ notify_erase_search_end
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Notifies a search ended.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link11">Content change notifications.
+</a>
+
+</h2>
+
+<p>Notifications called when the content of the table changes in a way that can affect the resize policy.</p>
+
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>inline</b> <b>void</b>
+ notify_inserted
+ (<a href = "#size_type3735929547">size_type</a> num_e)</pre>
+
+
+</td>
+
+<td>
+<p>Notifies an element was inserted.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <b>void</b>
+ notify_erased
+ (<a href = "#size_type3735929547">size_type</a> num_e)</pre>
+
+
+</td>
+
+<td>
+<p>Notifies an element was erased.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>void</b>
+ notify_cleared
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Notifies the table was cleared.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link12">Size change notifications.
+</a>
+
+</h2>
+
+<p>Notifications called when the table changes size.</p>
+
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>void</b>
+ notify_resized
+ (<a href = "#size_type3735929547">size_type</a> new_size)</pre>
+
+
+</td>
+
+<td>
+<p>Notifies the table was resized to <font color = "#666666"><tt>new_size</tt></font>.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link13">Queries.
+</a>
+
+</h2>
+
+<p>Called to query whether/how to resize.</p>
+
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a href = "#size_type3735929547">size_type</a>
+ get_init_size
+ () <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Queries initial size.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <b>bool</b>
+ is_resize_needed
+ () <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Queries whether a resize is needed.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a href = "#size_type3735929547">size_type</a>
+ get_new_size
+ (<a href = "#size_type3735929547">size_type</a> size, <a href = "#size_type3735929547">size_type</a> num_used_e) <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Queries what the new <font color = "#666666"><tt>size</tt></font> should be.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+
+
+</body>
+
+</html>
+
+
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/home.html b/libstdc++-v3/docs/html/ext/pb_assoc/home.html
new file mode 100644
index 0000000..79b8066
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/home.html
@@ -0,0 +1,56 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+<HTML>
+<HEAD>
+<TITLE>pb_assoc</TITLE>
+<META NAME="Generator" content="Microsoft Visual Studio .NET 7.1">
+</HEAD>
+<BODY>
+<h1>
+ <tt>pb_assoc</tt> -
+ Policy Based Associative Containers
+</h1>
+
+ <h5>Ami Tavory and Vladimir Dreizin, IBM Haifa Research Laboratories,
+ and Benjamin Kosnik, Red Hat
+ </h5>
+
+ <h5>
+ <a href = "mailto:pbassoc@gmail.com">pbassoc@gmail.com</a>
+ </h5>
+
+<p>
+</p>
+
+<p>
+ The <tt>pb_assoc</tt> library is a library of policy-based associative
+containers, designed for high-performance, flexibility, and semantic safety.
+</p>
+
+<p>The documentation is organized as follows.
+</p>
+<ol>
+ <li> The <a href = "introduction.html">Introduction</a> Section describes the problems which this library tries to address.</li>
+ <li>The <a href = "motivation.html">Motivation</a> Section describes and motivates
+the main differences between this library and the STL's associative containers.</li>
+ <li>The <a href = "design.html">Design</a> Section describes the design.
+ <ol>
+ <li> <a href = "overview.html">Overview</a> describes an overview.</li>
+ <li> <a href = "ds_gen.html">Data-Structure Genericity</a> discusses generic manipulation of containers based on different underlying data-structures.</li>
+ <li> <a href = "ms_gen.html">Mapping-Semantic Genericity</a> discusses generic manipulation of containers with different mapping semantics.</li>
+ <li> <a href = "hash_based_containers.html">Hash-Based Containers</a> describes the design and policies of hash-based containers.</li>
+ <li> <a href = "tree_based_containers.html">Tree-Based Containers</a> describes the design and policies of tree-based containers.</li>
+ <li> <a href = "lu_based_containers.html">List-Based Containers</a> describes the design and policies of list-based containers with update policies.</li>
+ </ol>
+ </li>
+ <li> The <a href = "interface.html">Interface</a>
+Section provides links to the interfaces of the classes.
+ </li>
+ <li>The
+<a href = "examples.html">Examples</a> Section shows examples of using and extending
+the library.
+ </li>
+</ol>
+
+
+</BODY>
+</HTML>
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/index.html b/libstdc++-v3/docs/html/ext/pb_assoc/index.html
new file mode 100644
index 0000000..1e08641
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/index.html
@@ -0,0 +1,12 @@
+<HTML>
+<HEAD>
+<TITLE>pb_assoc</TITLE>
+<META NAME="Generator" content="Microsoft Visual Studio .NET 7.1">
+</HEAD>
+
+<frameset cols = "15%, 85%">
+ <frame src = "toc.html">
+ <frame src = "home.html" name = "content">
+</frameset>
+
+</HTML> \ No newline at end of file
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/insert_resize_sequence_diagram1.jpg b/libstdc++-v3/docs/html/ext/pb_assoc/insert_resize_sequence_diagram1.jpg
new file mode 100644
index 0000000..6e8a94d
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/insert_resize_sequence_diagram1.jpg
Binary files differ
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/insert_resize_sequence_diagram2.jpg b/libstdc++-v3/docs/html/ext/pb_assoc/insert_resize_sequence_diagram2.jpg
new file mode 100644
index 0000000..4aa2c6c
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/insert_resize_sequence_diagram2.jpg
Binary files differ
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/insert_resize_sequence_diagram3.jpg b/libstdc++-v3/docs/html/ext/pb_assoc/insert_resize_sequence_diagram3.jpg
new file mode 100644
index 0000000..e7cadf1
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/insert_resize_sequence_diagram3.jpg
Binary files differ
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/insert_type_methods.html b/libstdc++-v3/docs/html/ext/pb_assoc/insert_type_methods.html
new file mode 100644
index 0000000..3687a5b
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/insert_type_methods.html
@@ -0,0 +1,42 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+<html>
+<head>
+<title>Insert-type Methods</title>
+<meta name="GENERATOR" content="Microsoft Visual Studio .NET 7.1">
+<meta name="vs_targetSchema" content="http://schemas.microsoft.com/intellisense/ie5">
+</head>
+<body bgcolor = "white">
+<h2>Insert-Type Methods</h2>
+<TABLE WIDTH="100%" BORDER="1" ID="Table1">
+ <TR>
+ <TD Width = "30%" ALIGN="left"><b>Method</b></TD>
+ <TD Width = "50%" ALIGN="left"><b>Description</b></TD>
+ <TD Width = "10%" ALIGN="left"><b>Complexity Guarantee</b></TD>
+ <TD Width = "10%" ALIGN="left"><b>Exception Guarantee</b></TD>
+ </TR>
+ <TR>
+ <TD ALIGN="left">
+<pre><b>inline</b> std::pair&lt;<a href = "find_iterator.html">find_iterator</a>, <b>bool</b>&gt;
+ insert
+ (<a href = "mapped_value_type_defs.html">const_mapped_reference</a> r_value)
+</pre>
+ </TD>
+ <TD ALIGN="left">Inserts <tt>r_value</tt> into the table. Writes only if an entry with an equivalent key does not exist. If the entry was written, returns
+<pre>std::make_pair(it, <b>true</b>)
+</pre> where <tt>it</tt> corresponds to the new entry;
+ Otherwise, returns
+<pre>std::make_pair(<a href = "find_type_methods.html">find_end()</a>, <b>false</b>)
+</pre>.</TD>
+ <TD ALIGN="left"><i>O(1)</i> average <p><i>O(m)</i> worst</p> <p>(<i>m</i> = #entries)</p> <p><sub><a href = "#mmap_complex">[1]</a></sub></p></TD>
+ <TD ALIGN="left"><a href = "exception_guarantees_specifics.html#basic_guarantee">1</a>,<a href = "exception_guarantees_specifics.html#strong_guarantee">2</a></TD>
+ </TR>
+</TABLE>
+
+<p>
+<a name = "mmap_complex">[1]</a> Note that for multimap types, the mapped data part is a collection, and so the average and worst case complexities
+need to be multiplied by the corresponding complexities of copying collections.
+</p>
+
+
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/interface.html b/libstdc++-v3/docs/html/ext/pb_assoc/interface.html
new file mode 100644
index 0000000..11bf5d1
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/interface.html
@@ -0,0 +1,342 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+<HTML>
+<HEAD>
+ <TITLE>Interface</TITLE>
+ <META NAME="Generator" content="Microsoft Visual Studio .NET 7.1">
+</HEAD>
+<BODY>
+
+<H1>Interface</H1>
+<p>
+ Following is the library's interface:
+</p>
+<ol>
+ <li> <a href = "tutorial.html">Short Tutorial</a> is a short tutorial. </li>
+ <li> <a href="#containers">Containers</a> describes the containers of
+the library.
+ </li>
+ <li>
+ <a href="#ds_pol">Data-Type Policies</a> describes data-type policies.
+ </li>
+ <li>
+ <a href="#ds_tag">Data-Structure Tags and Traits</a> describes
+ tags and traits identifying the underlying data-structure and its behaviour.
+ </li>
+ <li>
+ <a href="#ms_tag">Mapping-Semantics Tags and Traits</a> describes
+ tags and traits identifying the mapping-semantics.
+ </li>
+ <li>
+ <a href = "#ds_policy_classes">Data-Structure Policy Classes</a> describes
+ policies for configuring underlying data-structures.
+ </li>
+ <li>
+ <a href="#exceptions">Exceptions</a> Subsection desribes exception classes.
+ </li>
+</ol>
+
+
+<hr>
+
+
+
+<h2><a name = "containers">Containers</a></h2>
+
+<p>
+<a href = "overview.html">Overview</a> and
+<a href = "ds_gen.html">Data-Structure Genericity</a> discuss relevant design
+points.
+</p>
+
+<h6 align = "center">
+<a name = "cd">
+<img src = "cd.jpg" width = "70%" alt = "no image">
+</h6>
+</a>
+<h6 align = "center">
+class hierarchy.
+</h6>
+
+<ol>
+ <li>
+ Basic Associative-Containers:
+ <ol>
+ <li><a href = "basic_assoc_cntnr.html"><tt>basic_assoc_cntnr</tt></a> - basic associative-container for the &quot;map&quot; case</li>
+ <li><a href = "basic_assoc_cntnr_no_data.html"><tt>basic_assoc_cntnr</tt></a> - basic associative-container for the &quot;set&quot; case</li>
+ <li><a href = "basic_assoc_cntnr_compound_data.html"><tt>basic_assoc_cntnr</tt></a> - basic associative-container for the &quot;multimap&quot; case</li>
+ </ol>
+ </li>
+ <li>
+ Hash-Based Associative-Containers:
+ <ol>
+ <li><a href = "basic_hash_assoc_cntnr.html"><tt>basic_hash_assoc_cntnr</tt></a> - basic hash-based associative-container </li>
+ <li><a href = "cc_hash_assoc_cntnr.html"><tt>cc_hash_assoc_cntnr</tt></a> - collision-chaining hash-based associative-container </li>
+ <li><a href = "gp_hash_assoc_cntnr.html"><tt>gp_hash_assoc_cntnr</tt></a> - (general) probing hash-based associative-container </li>
+ </ol>
+ </li>
+ <li>
+ Tree-Based Associative-Containers:
+ <ol>
+ <li><a href = "basic_tree_assoc_cntnr.html"><tt>basic_tree_assoc_cntnr</tt></a> - basic tree-based associative-container </li>
+ <li><a href = "basic_tree_assoc_cntnr_rev.html"><tt>basic_tree_assoc_cntnr</tt></a> - basic tree-based associative-container with reverse iteration </li>
+ <li><a href = "tree_assoc_cntnr.html"><tt>tree_assoc_cntnr</tt></a> - tree-based associative-container </li>
+ </ol>
+ </li>
+ <li>
+ List-Based Associative-Contaiers:
+ <ol>
+ <li><a href = "lu_assoc_cntnr.html"><tt>lu_assoc_cntnr</tt></a> - list-based update-policy associative container</li>
+ </ol>
+ </li>
+</ol>
+
+
+<hr>
+
+
+<h2><a name = "ds_pol">Data-Type Policies</a></h2>
+
+<p>
+<a href = "overview.html">Overview</a> and
+<a href = "ms_gen.html">Mapping-Semantic Genericity</a> discuss relevant design
+points.
+</p>
+
+<ol>
+ <li><a href = "null_data_type.html"><tt>null_data_type</tt></a>
+ </li>
+ <li><a href = "compound_data_type.html"><tt>compound_data_type</tt></a>
+ </li>
+</ol>
+
+<hr>
+
+
+
+
+<h2><a name = "ds_tag">Data-Structure Tags and Traits</a></h2>
+
+<p>
+
+</p>
+
+<h3>Data-Structure Tags</h3>
+
+<h6 align = "center">
+<a name = "cd">
+<img src = "ds_tag_cd.jpg" width = "70%" alt = "no image">
+</h6>
+</a>
+<h6 align = "center">
+Data-Structure Tag class hierarchy.
+</h6>
+
+<ol>
+ <li> <a href = "basic_ds_tag.html"><tt>basic_ds_tag</tt></a></li>
+ <li> <a href = "basic_hash_ds_tag.html"><tt>basic_hash_ds_tag</tt></a></li>
+ <li> <a href = "cc_hash_ds_tag.html"><tt>cc_hash_ds_tag</tt></a></li>
+ <li> <a href = "gp_hash_ds_tag.html"><tt>gp_hash_ds_tag</tt></a></li>
+ <li> <a href = "basic_tree_ds_tag.html"><tt>basic_tree_ds_tag</tt></a></li>
+ <li> <a href = "rb_tree_ds_tag.html"><tt>rb_tree_ds_tag</tt></a></li>
+ <li> <a href = "splay_tree_ds_tag.html"><tt>splay_tree_ds_tag</tt></a></li>
+ <li> <a href = "ov_tree_ds_tag.html"><tt>ov_tree_ds_tag</tt></a></li>
+ <li> <a href = "lu_ds_tag.html"><tt>lu_ds_tag</tt></a></li>
+ <li> <a href = "compound_ds_tag.html"><tt>compound_ds_tag</tt></a></li>
+</ol>
+
+
+<h3>Invalidation-Guarantee Tags</h3>
+
+<h6 align = "center">
+<a name = "cd">
+<img src = "invalidation_guarantee_cd.jpg" width = "70%" alt = "no image">
+</h6>
+</a>
+<h6 align = "center">
+Invalidation guarantees class hierarchy.
+</h6>
+
+<ol>
+ <li> <a href = "basic_invalidation_guarantee.html"><tt>basic_invalidation_guarantee</tt></a></li>
+ <li> <a href = "find_invalidation_guarantee.html"><tt>find_invalidation_guarantee</tt></a></li>
+ <li> <a href = "range_invalidation_guarantee.html"><tt>range_invalidation_guarantee</tt></a></li>
+</ol>
+
+<h3>Data-Structure Traits</h3>
+
+<ol>
+ <li> <a href = "ds_traits.html"><tt>ds_traits</tt></a></li>
+</ol>
+
+
+<hr>
+
+
+<h2><a name = "ms_tag">Mapping-Semantics Tags and Traits</a></h2>
+
+<p>
+
+</p>
+
+<h3>Mapping-Semantics Tags</h3>
+
+<h6 align = "center">
+<a name = "cd">
+<img src = "ms_tag_cd.jpg" width = "70%" alt = "no image">
+</h6>
+</a>
+<h6 align = "center">
+Mapping-Semantics Tag class hierarchy.
+</h6>
+
+<ol>
+ <li> <a href = "basic_ms_tag.html"><tt>basic_ms_tag</tt></a></li>
+ <li> <a href = "data_enabled_ms_tag.html"><tt>data_enabled_ms_tag</tt></a></li>
+ <li> <a href = "compound_data_enabled_ms_tag.html"><tt>compound_data_enabled_ms_tag</tt></a></li>
+</ol>
+
+
+<h3>Mapping-Semantics Traits</h3>
+
+<ol>
+ <li> <a href = "ms_traits.html"><tt>ms_traits</tt></a></li>
+</ol>
+
+
+<hr>
+
+
+<h2><a name="ds_policy_classes">Data-Structure Policy Classes</a></h2>
+
+
+<h3>Hash-Related Policies</h3>
+
+<p>
+</p><a href = "hash_based_containers.html">Hash-Based Containers</a> describes
+relevant design points.
+</p>
+
+<h4>Hash and Probe Policies</h4>
+<ol>
+ <li> Hash Functions:
+ <ol>
+ <li> <a href="null_hash_fn.html"><tt>null_hash_fn</tt></a></li>
+ </ol>
+ </li>
+ <li> Range-Hashing Functions:
+ <ol>
+ <li><a href="sample_range_hashing.html">Interface of a Range-Hashing Function</a></li>
+ <li> <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a></li>
+ <li> <a href="direct_mod_range_hashing.html"><tt>direct_mod_range_hashing</tt></a></li>
+ </ol>
+ </li>
+ <li> Probe Functions:
+ <ol>
+ <li> <a href="sample_probe_fn.html">Interface of a Probe Function</a></li>
+ <li> <a href="linear_probe_fn.html"><tt>linear_probe_fn</tt></a></li>
+ <li> <a href="quadratic_probe_fn.html"><tt>quadratic_probe_fn</tt></a></li>
+ <li> <a href="null_probe_fn.html"><tt>null_probe_fn</tt></a></li>
+ </ol>
+ </li>
+ <li> Ranged-Hash Functions:
+ <ol>
+ <li><a href="ranged_hash_fn.html">Interface of a Ranged-Hash Function</a></li>
+ </ol>
+ </li>
+ <li> Ranged-Probe Functions:
+ <ol>
+ <li> <a href="ranged_probe_fn.html">Interface of a Ranged-Probe function</a></li>
+ </ol>
+ </li>
+</ol>
+
+
+
+<h4>Resize Policies</h4>
+
+<h6 align = "center">
+<a name = "resize_policy_cd">
+<img src = "resize_policy_cd.jpg" width = "70%" alt = "no image">
+</a>
+</h6>
+<h6 align = "center">
+Resize policy class diagram.
+</h6>
+
+<ol>
+ <li> Resize Policies:
+ <ol>
+ <li> <a href="sample_resize_policy.html">Interface of a Resize Policy</a>
+ <li> <a href="ht_standard_resize_policy.html"><tt>ht_standard_resize_policy</tt></a></li>
+ </ol>
+ </li>
+ <li> Size Policies:
+ <ol>
+ <li> <a href="sample_size_policy.html">Interface of a Size Policy</a></li>
+ <li> <a href="ht_exponential_size_policy.html"><tt>ht_exponential_size_policy</tt></a></li>
+ <li> <a href="ht_prime_size_policy.html"><tt>ht_prime_size_policy</tt></a></li>
+ </ol>
+ </li>
+ <li> Trigger Policies:
+ <ol>
+ <li><a href="sample_resize_trigger.html">Interface of a Trigger Policy</a></li>
+ <li> <a href="ht_load_check_resize_trigger.html"><tt>ht_load_check_resize_trigger</tt></a></li>
+ <li> <a href="ht_max_collision_check_grow_resize_trigger.html"><tt>ht_max_collision_check_grow_resize_trigger</tt></a></li>
+ </ol>
+ </li>
+</ol>
+
+
+
+<h3>Tree Node-Update Policies</h3>
+<ol>
+ <li> <a href = "node_invariants.html">Design of Node Update Policies</a></li>
+ <li> <a href="sample_node_updator.html">Interface of a Node Updator Policy</a></li>
+ <li> Order-Statistics (Finding Entries by Key Order):
+ <ol>
+ <li> <a href="order_statistics_key.html"><tt>order_statistics_key</tt></a></li>
+ <li> <a href="order_statistics_key_cmp.html"><tt>order_statistics_key_cmp</tt></a></li>
+ <li> <a href="order_statistics_node_updator.html"><tt>order_statistics_node_updator</tt></a></li>
+ <li> <a href="find_by_order.html"><tt>find_by_order</tt></a></li>
+ <li> <a href="order_by_key.html"><tt>order_by_key</tt></a></li>
+ </ol>
+ </li>
+ <li> <a href="null_node_updator.html"><tt>null_node_updator</tt></a></li>
+</ol>
+
+
+<h3>List Update Policies</h3>
+<ol>
+ <li> <a href = "list_updates.html">Design of List Update Policies</a> </li>
+ <li> <a href = "sample_update_policy.html">Interface of a List Update Policy</a> </li>
+ <li> Move-to-Front:
+ <ol>
+ <li> <a href="move_to_front_update_metadata.html"><tt>move_to_front_update_metadata</tt></a></li>
+ <li> <a href="move_to_front_update_policy.html"><tt>move_to_front_update_policy</tt></a></li>
+ </ol>
+ </li>
+ <li> Counter:
+ <ol>
+ <li> <a href="counter_update_metadata.html"><tt>counter_update_metadata</tt></a></li>
+ <li> <a href="counter_update_policy.html"><tt>counter_update_policy</tt></a></li>
+ </ol>
+ </li>
+</ol>
+
+
+<hr>
+
+
+
+
+<h2><a name="exceptions">Exceptions</a></h2>
+<ol>
+ <li> <a href="pb_assoc_ex.html"><tt>pb_assoc_ex</tt></a></li>
+ <li> <a href="cannot_insert.html"><tt>cannot_insert</tt></a></li>
+ <li> <a href="cannot_join.html"><tt>cannot_join</tt></a></li>
+ <li> <a href="cannot_resize.html"><tt>cannot_resize</tt></a></li>
+</ol>
+
+
+</BODY>
+</HTML>
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/interval_node_invariants.jpg b/libstdc++-v3/docs/html/ext/pb_assoc/interval_node_invariants.jpg
new file mode 100644
index 0000000..0f4db96
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/interval_node_invariants.jpg
Binary files differ
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/introduction.html b/libstdc++-v3/docs/html/ext/pb_assoc/introduction.html
new file mode 100644
index 0000000..e31dfc7
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/introduction.html
@@ -0,0 +1,31 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+<HTML>
+<HEAD>
+<TITLE>Introduction</TITLE>
+<META NAME="Generator" content="Microsoft Visual Studio .NET 7.1">
+<base target = "content">
+</HEAD>
+<BODY>
+<H1>Introduction</H1>
+
+<p>
+ There are (at least) three orthogonal challenges to designing generic associative containers:
+</p>
+
+<ol>
+ <li> The choice of underlying data-structure affects not only the performance of containers, but their semantics as well. <i>E.g.</i>, containers based on trees store elements by a given order, while containers based on hash tables store elements in a meaningless (and probably time-varying) order; containers based on node-based trees can guarantee exception-free element erasing, while containers based on vector-based trees cannot. This complicates generic manipulation of associative containers based on different underlying data-structures.
+ </li>
+ <li>
+ Underlying data-structures can act very differently given different policies. <i>E.g.</i>, the policy by which a hash table translates a hash value into a position within a table affects performance dramatically; certain policies can make containers based on trees support order statistics (<i>i.e.</i>, queries on the order of stored elements) or other useful queries. This complicates the policy design of an associative container based on a given data-structure.
+ </li>
+ <li>
+ Various mapping semantics are appropriate in different settings. <i>E.g.</i>, in some cases a unique mapping between each key and a datum is appropriate (such as the STL's <tt>std::map</tt> guarantees); in other cases, unique storage of keys is required (such as the STL's <tt>std::set</tt> guarantees); in other cases, more complex mapping semantics are required. This complicates generic manipulation of associative containers with different mapping semantics.
+ </li>
+</ol>
+
+<p>
+ <tt>pb_assoc</tt> attempts to address these problems safely and efficiently.
+</p>
+
+</BODY>
+</HTML>
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/invalidation_guarantee_cd.jpg b/libstdc++-v3/docs/html/ext/pb_assoc/invalidation_guarantee_cd.jpg
new file mode 100644
index 0000000..dde6700
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/invalidation_guarantee_cd.jpg
Binary files differ
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/invalidation_guarantee_erase.jpg b/libstdc++-v3/docs/html/ext/pb_assoc/invalidation_guarantee_erase.jpg
new file mode 100644
index 0000000..d167097
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/invalidation_guarantee_erase.jpg
Binary files differ
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/lib_download.html b/libstdc++-v3/docs/html/ext/pb_assoc/lib_download.html
new file mode 100644
index 0000000..2007631
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/lib_download.html
@@ -0,0 +1,47 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+<html>
+<head>
+<title>Library Download and Install</title>
+<meta name="GENERATOR" content="Microsoft Visual Studio .NET 7.1">
+<meta name="vs_targetSchema" content="http://schemas.microsoft.com/intellisense/ie5">
+</head>
+<body bgcolor = "white">
+<h1>Library Download and Install</h1>
+
+<ol>
+ <li><a href = "#requirements">Requirements</a></li>
+ <li><a href = "#donwload">Download</a></li>
+ <li><a href = "#install">Install</a></li>
+ <li><a href = "#use">Use</a></li>
+</ol>
+
+<h2><a name = "requirements">Requirements</a></h2>
+
+<p>
+ The library compiles and runs on the newer versions of
+<tt>g++</tt>, <tt>icc</tt> and <tt>Visual C++ .net</tt>. The
+<a href = "portability.html">Portability</a> Section describes the known
+compilers with which it works.
+</p>
+
+<p>
+ Unfortunately, we do not have access to other compilers, and so do not
+know how to define some standard policies whose namespaces and declarations
+we know only on
+<tt>g++</tt>, <tt>icc</tt>, and <tt>Visual C++ .net</tt>.
+We would appreciate help on this point.
+</p>
+
+<h2><a name = "donwload">Download</a></h2>
+
+<p>
+ The following <a href = "pb_assoc.zip">link</a> contains a zip
+file of the library.
+</p>
+
+
+<h2><a name = "install">Install</a></h2>
+
+
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/linear_probe_fn.html b/libstdc++-v3/docs/html/ext/pb_assoc/linear_probe_fn.html
new file mode 100644
index 0000000..65943f2
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/linear_probe_fn.html
@@ -0,0 +1,238 @@
+
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+
+
+<html>
+<head>
+<title>linear_probe_fn Interface
+</title>
+
+</head>
+
+<body>
+<h1>
+<tt>linear_probe_fn
+</tt>
+
+ Interface
+
+
+</h1>
+
+<p>A probe sequence policy using fixed increments.
+</p>
+
+<ol>
+<li>
+<a href = "../../../../include/ext/pb_assoc/hash_policy.hpp"><tt>hash_policy.hpp</tt>
+</a>
+
+</li>
+
+<li>
+<a href = "#link1">Template parameters.
+</a>
+
+</li>
+
+<li>
+Public Types and Constants:
+
+
+<ol>
+<li>
+<a href = "#link2">General definitions.
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+<li>
+Public Methods:
+
+
+<ol>
+<li>
+<a href = "#link3">Constructors, destructor, and related.
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+<li>
+Protected Methods:
+
+
+<ol>
+<li>
+<a href = "#link4">Offset methods.
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+</ol>
+
+
+<h2>
+<a name = "link1">Template parameters.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "20%" ALIGN = "left"><b>Parameter</b></TD><TD Width = "50%" ALIGN = "left"><b>Description</b></TD><TD Width = "30%" ALIGN = "left"><b>Default Value</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "Const_Key_Ref3735929850">Const_Key_Ref</a></pre>
+
+
+</td>
+
+<td>
+<p>Const key reference type.</p>
+
+
+</td>
+
+<td>
+-
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "Size_Type3735929483">Size_Type</a></pre>
+
+
+</td>
+
+<td>
+<p>Size type.</p>
+
+
+</td>
+
+<td>
+size_t
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link2">General definitions.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "30%" ALIGN = "left"><b>Type</b></TD><TD Width = "55%" ALIGN = "left"><b>Definition</b></TD><TD Width = "15%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "size_type3735929547">size_type</a></pre>
+
+
+</td>
+
+<td>
+<pre><a href = "#Size_Type3735929483">Size_Type</a></pre>
+
+
+</td>
+
+<td>
+<p>Size type.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link3">Constructors, destructor, and related.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>void</b>
+ swap
+ (<font color = "olive">linear_probe_fn</font> &amp;r_other)</pre>
+
+
+</td>
+
+<td>
+<p>Swaps content.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link4">Offset methods.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>inline</b> <a href = "#size_type3735929547">size_type</a>
+ <b>operator</b>()
+ (<a href = "#Const_Key_Ref3735929850">Const_Key_Ref</a> r_key,
+ <a href = "#size_type3735929547">size_type</a> i) <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Returns the <font color = "#666666"><tt>i</tt></font>-th offset from the hash value.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+
+
+</body>
+
+</html>
+
+
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/list_updates.html b/libstdc++-v3/docs/html/ext/pb_assoc/list_updates.html
new file mode 100644
index 0000000..e45843b
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/list_updates.html
@@ -0,0 +1,138 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+<html>
+ <head>
+ <title>List Updates</title>
+ <meta name="GENERATOR" content="Microsoft Visual Studio .NET 7.1">
+ <meta name="vs_targetSchema" content="http://schemas.microsoft.com/intellisense/ie5">
+ </head>
+
+<body bgcolor = "white">
+
+<h1>List-Update Containers</h1>
+
+<p>
+ This section describes policies for list updates. It is organized as follows:
+</p>
+
+<ol>
+ <li> The <a href = "#general">General Terms</a> Subsection describes general
+ terms.
+ </li>
+ <li> The <a href = "#imp_pb_assoc">Implementation in <tt>pb_assoc</tt></a>
+ Subsection describes the implementation of these concepts in <tt>pb_assoc</tt>.
+ </li>
+</ol>
+
+
+<h2><a name = "general">General Terms</a></h2>
+
+<p>
+ Associative containers use some attributes of the keys of which they store: tree-based
+containers use the ability to compare keys; hash-based containers use the ability to map
+keys into numbers.
+</p>
+
+<p>
+ In the (rare) case where keys can only be checked for equivalence, these
+types of containers cannot be used. In such a case, storing the entries in a list is a reasonable solution.
+Clearly, the order of the elements within the list affects performance; ideally, frequently accessed elements
+should be at the front of the list.
+</p>
+
+<p>
+ Many remarkable (online competitive
+[<a href = "references.html#motwani95random">motwani95random</a>])
+algorithms exist for reordering lists to reflect access prediction
+[<a href = "references.html#andrew04mtf">andrew04mtf</a>]. Some of these algorithms require storing
+metadata with each key, while others do not. Some of these algorithms require only the ability to
+move an element to the front of the list, while others require the ability to interchange an element and
+its predecessor.
+</p>
+
+<p>
+ For example, Figure
+<a href = "#lu">-A
+The counter algorithm
+</a>
+shows the counter algorithm. Each node contains both a key and a count metadata (shown in bold).
+When an element is accessed (<i>e.g.</i> 6)
+its count is incremented, as shown in
+Figure
+<a href = "#lu">
+The counter algorithm
+</a>-B.
+If the count reaches some predetermined value, say 10, as shown in
+Figure
+<a href = "#lu">
+The counter algorithm
+</a>-C,
+the count is set to 0
+and the node is moved to the front of the list, as in
+Figure
+<a href = "#lu">
+The counter algorithm
+</a>-D.
+
+
+</p>
+
+<h6 align = "center">
+<a name = "lu">
+<img src = "lu.jpg" width = "65%">
+</a>
+</h6>
+<h6 align = "center">
+The counter algorithm.
+</h6>
+
+
+
+<h2><a name = "imp_pb_assoc">Implementation in <tt>pb_assoc</tt></a></h2>
+
+<p>
+ The <tt>pb_assoc</tt> library allows instantiating lists with policies
+implementing any algorithm moving nodes to the front of the list (policies implementing
+algorithms interchanging nodes are currently unsupported).
+</p>
+
+<p>
+ Associative containers based on lists are parameterized by a <tt>Update_Policy</tt> parameter.
+This parameter defines the type of metadata each node contains, how to create the metadata, and how to
+decide, using this metadata, whether to move a node to the front of the list.
+ A list-based associative container object derives (publicly) from its update policy.
+</p>
+
+<p>
+ An instantiation of <tt>Update_Policy</tt> must define internally <tt>update_metadata</tt> as the metadata
+it requires. Internally, each node of the list contains, besides the usual key and data, an instance
+of <tt><b>typename</b> Update_Policy::update_metadata</tt>.
+</p>
+
+<p>
+ An instantiation of <tt>Update_Policy</tt> must define internally two operators:
+</p>
+<pre>
+update_metadata
+ <b>operator</b>()
+ ();
+
+<b>bool</b>
+ <b>operator</b>()
+ (update_metadata &);
+</pre>
+
+<p>
+ The first is called by the container object, when creating a new node, to create the node's metadata. The
+second is called by the container object, when a node is accessed (<i>e.g.</i>, when a find operation's key
+is equivalent to the key of the node), to determine whether to move the node to the front of the list.
+</p>
+
+<p>
+ Additionally, the library contains implementations of the move-to-front and counter policies. These
+are described in
+<a href="interface.html#policy_classes">Policy Classes</a>.
+</p>
+
+</body>
+
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/lu_assoc_cntnr.html b/libstdc++-v3/docs/html/ext/pb_assoc/lu_assoc_cntnr.html
new file mode 100644
index 0000000..c9d0c75
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/lu_assoc_cntnr.html
@@ -0,0 +1,570 @@
+
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+
+
+<html>
+<head>
+<title>lu_assoc_cntnr Interface
+</title>
+
+</head>
+
+<body>
+<h1>
+<tt>lu_assoc_cntnr
+</tt>
+
+ Interface
+
+
+</h1>
+
+<p>A list-update based associative container.
+</p>
+
+<ol>
+<li>
+<a href = "../../../../include/ext/pb_assoc/assoc_cntnr.hpp"><tt>assoc_cntnr.hpp</tt>
+</a>
+
+</li>
+
+<li>
+<a href = "#link1">Template parameters.
+</a>
+
+</li>
+
+<li>
+<a href = "#link2">Base classes.
+</a>
+
+</li>
+
+<li>
+Public Types and Constants:
+
+
+<ol>
+<li>
+<a href = "#link3">Policy definitions.
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+<li>
+Public Methods:
+
+
+<ol>
+<li>
+<a href = "#link4">Constructors, destructor, and related.
+</a>
+
+</li>
+
+<li>
+<a href = "#link5">Policy access methods.
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+</ol>
+
+
+<h2>
+<a name = "link1">Template parameters.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "20%" ALIGN = "left"><b>Parameter</b></TD><TD Width = "50%" ALIGN = "left"><b>Description</b></TD><TD Width = "30%" ALIGN = "left"><b>Default Value</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "Key3735928856">Key</a></pre>
+
+
+</td>
+
+<td>
+<p>Key type.</p>
+
+
+</td>
+
+<td>
+-
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "Data3735928937">Data</a></pre>
+
+
+</td>
+
+<td>
+<p>Data type.</p>
+
+
+</td>
+
+<td>
+-
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "Eq_Fn3735929016">Eq_Fn</a></pre>
+
+
+</td>
+
+<td>
+<p>Equivalence functor.</p>
+
+
+</td>
+
+<td>
+<pre>std::equal_to&lt;<a href = "#Key3735928856">Key</a>&gt;</pre>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "Update_Policy3735929889">Update_Policy</a></pre>
+
+
+</td>
+
+<td>
+<p>Update policy (determines when an element will be moved to the front of the list.</p>
+
+
+</td>
+
+<td>
+<a href = "move_to_front_update_policy.html"><tt>move_to_front_update_policy</tt></a>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "Allocator3735929488">Allocator</a></pre>
+
+
+</td>
+
+<td>
+<p>Allocator type.</p>
+
+
+</td>
+
+<td>
+<pre>std::allocator&lt;<b>char</b>&gt;</pre>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link2">Base classes.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "80%" ALIGN = "left"><b>Class</b></TD><TD Width = "20%" ALIGN = "left"><b>Derivation Type</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a href = "#Update_Policy3735929889">Update_Policy</a></pre>
+
+
+</td>
+
+<td>
+<p>public</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link3">Policy definitions.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "30%" ALIGN = "left"><b>Type</b></TD><TD Width = "55%" ALIGN = "left"><b>Definition</b></TD><TD Width = "15%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "eq_fn3735929080">eq_fn</a></pre>
+
+
+</td>
+
+<td>
+<pre><a href = "#Eq_Fn3735929016">Eq_Fn</a></pre>
+
+
+</td>
+
+<td>
+<p>Equivalence functor type.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "allocator3735929520">allocator</a></pre>
+
+
+</td>
+
+<td>
+<pre><a href = "#Allocator3735929488">Allocator</a></pre>
+
+
+</td>
+
+<td>
+<p>Allocator type.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "update_policy3735929953">update_policy</a></pre>
+
+
+</td>
+
+<td>
+<pre><a href = "#Update_Policy3735929889">Update_Policy</a></pre>
+
+
+</td>
+
+<td>
+<p>List update policy type.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link4">Constructors, destructor, and related.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre> lu_assoc_cntnr
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Default constructor.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre> lu_assoc_cntnr
+ (<b>const</b> <a href = "#Eq_Fn3735929016">Eq_Fn</a> &amp;r_eq_fn)</pre>
+
+
+</td>
+
+<td>
+<p>Constructor taking some policy objects. <font color = "#666666"><tt>r_eq_fn</tt></font> will be copied by the <a href = "#Eq_Fn3735929016"><tt>Eq_Fn</tt></a> object of the container object.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre> lu_assoc_cntnr
+ (<b>const</b> <a href = "#Eq_Fn3735929016">Eq_Fn</a> &amp;r_eq_fn,
+ <b>const</b> <a href = "#Update_Policy3735929889">Update_Policy</a> &amp;r_update_policy)</pre>
+
+
+</td>
+
+<td>
+<p>Constructor taking some policy objects. <font color = "#666666"><tt>r_eq_fn</tt></font> will be copied by the <a href = "#Eq_Fn3735929016"><tt>Eq_Fn</tt></a> object of the container object, and <font color = "#666666"><tt>r_update_policy</tt></font> will be copied by the <a href = "#Update_Policy3735929889"><tt>Update_Policy</tt></a> object of the container object.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>template</b>&lt;<b>class</b> It&gt;
+ lu_assoc_cntnr
+ (It first_it, It last_it)</pre>
+
+
+</td>
+
+<td>
+<p>Constructor taking iterators to a range of value_types. The value_types between <font color = "#666666"><tt>first_it</tt></font> and <font color = "#666666"><tt>last_it</tt></font> will be inserted into the container object.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>template</b>&lt;<b>class</b> It&gt;
+ lu_assoc_cntnr
+ (It first_it, It last_it,
+ <b>const</b> <a href = "#Eq_Fn3735929016">Eq_Fn</a> &amp;r_eq_fn)</pre>
+
+
+</td>
+
+<td>
+<p>Constructor taking iterators to a range of value_types and some policy objects. The value_types between <font color = "#666666"><tt>first_it</tt></font> and <font color = "#666666"><tt>last_it</tt></font> will be inserted into the container object.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>template</b>&lt;<b>class</b> It&gt;
+ lu_assoc_cntnr
+ (It first_it, It last_it,
+ <b>const</b> <a href = "#Eq_Fn3735929016">Eq_Fn</a> &amp;r_eq_fn,
+ <b>const</b> <a href = "#Update_Policy3735929889">Update_Policy</a> &amp;r_update_policy)</pre>
+
+
+</td>
+
+<td>
+<p>Constructor taking iterators to a range of value_types and some policy objects. The value_types between <font color = "#666666"><tt>first_it</tt></font> and <font color = "#666666"><tt>last_it</tt></font> will be inserted into the container object.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre> lu_assoc_cntnr
+ (<b>const</b> <font color = "olive">lu_assoc_cntnr</font> &amp;r_other)</pre>
+
+
+</td>
+
+<td>
+<p>Copy constructor.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>virtual</b>
+ ~lu_assoc_cntnr
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Destructor.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><font color = "olive">lu_assoc_cntnr</font> &amp;
+ <b>operator</b>=
+ (<b>const</b> <font color = "olive">lu_assoc_cntnr</font> &amp;r_other)</pre>
+
+
+</td>
+
+<td>
+<p>Assignment operator.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>void</b>
+ swap
+ (<font color = "olive">lu_assoc_cntnr</font> &amp;r_other)</pre>
+
+
+</td>
+
+<td>
+<p>Swaps content.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link5">Policy access methods.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a href = "#eq_fn3735929080">eq_fn</a> &amp;
+ get_eq_fn
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Access to the <a href = "#eq_fn3735929080"><tt>eq_fn</tt></a> object.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>const</b> <a href = "#eq_fn3735929080">eq_fn</a> &amp;
+ get_eq_fn
+ () <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Const access to the <a href = "#eq_fn3735929080"><tt>eq_fn</tt></a> object.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a href = "#update_policy3735929953">update_policy</a> &amp;
+ get_update_policy
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Access to the <a href = "#update_policy3735929953"><tt>update_policy</tt></a> object.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>const</b> <a href = "#update_policy3735929953">update_policy</a> &amp;
+ get_update_policy
+ () <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Const access to the <a href = "#update_policy3735929953"><tt>update_policy</tt></a> object.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+
+
+</body>
+
+</html>
+
+
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/lu_based_containers.html b/libstdc++-v3/docs/html/ext/pb_assoc/lu_based_containers.html
new file mode 100644
index 0000000..4ee23f4
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/lu_based_containers.html
@@ -0,0 +1,225 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+<html>
+ <head>
+ <title>List Updates</title>
+ <meta name="GENERATOR" content="Microsoft Visual Studio .NET 7.1">
+ <meta name="vs_targetSchema" content="http://schemas.microsoft.com/intellisense/ie5">
+ </head>
+
+<body bgcolor = "white">
+
+<h1>List-Update Containers</h1>
+
+
+<p>
+ This section describes list-based containers. It is organized as follows.
+</p>
+
+<ol>
+ <li> <a href = "#overview">Overview</a> is an overview.</li>
+ <li> <a href = "#list_updates">List Updates</a> describes updating lists
+as elements are accessed.</li>
+</ol>
+
+
+<h2><a name = "overview">Overview</a></h2>
+
+<p>
+ Associative containers typically use some attributes of the keys of which they store: tree-based
+containers use the ability to compare keys; hash-based containers use the ability to map
+keys into numbers.
+</p>
+
+<p>
+ In some cases it is better to avoid this:
+</p>
+
+<ol>
+ <li>
+ Hash-based and tree-based containers typically require additional memory
+ for time efficiency.
+ </li>
+ <li>
+ Hash-based and tree-based containers require extra information
+ about keys: hash-based containers need hash functors, tree-based containers need
+ comparison functors. In some (rare) cases, a key might be encapsulated to the extent that it is not possible to supply these functors.
+ </li>
+</ol>
+
+<p>
+ In such cases, storing the entries in a unique-key list is a reasonable solution.
+This uses the minimal amount of memory, and requires only an equivalence functor.
+Clearly, the order of the elements within the list affects performance; ideally, frequently accessed elements
+should be at the front of the list.
+</p>
+
+<p>
+ Many remarkable (online competitive
+[<a href = "references.html#motwani95random">motwani95random</a>])
+algorithms exist for reordering lists to reflect access prediction
+[<a href = "references.html#andrew04mtf">andrew04mtf</a>].
+</p>
+
+<p>
+ Figure
+<a href = "#lu_cd">List-update containers</a>
+ shows the container-hierarchy; the list-based container is circled.
+</p>
+
+<h6 align = "center">
+<a name = "lu_cd">
+<img src = "lu_cd.jpg" width = "70%" alt = "no image">
+</h6>
+<h6 align = "center">
+</a>
+List-update containers.
+</h6>
+
+
+<p>
+ The list-based container has the following declaration:
+</p>
+
+<pre>
+<b>template</b>&lt;
+ <b>typename</b> Key,
+ <b>typename</b> Data,
+ <b>class</b> Eq_Fn = std::equal_to&lt;Key&gt;,
+ <b>class</b> Update_Policy =
+ <a href = "move_to_front_lu_policy.html">move_to_front_lu_policy&lt;&gt;</a>,
+ <b>class</b> Allocator =
+ std::allocator&lt;<b>char</b>&gt; &gt;
+<b>class</b> <a href = "lu_assoc_cntnr.html">lu_assoc_cntnr</a>;
+</pre>
+
+
+<p>
+ The parameters have the following meaning:
+</p>
+<ol>
+ <li> <tt>Key</tt> is the key type.
+ </li>
+ <li> <tt>Data</tt> is the data-policy, and is explained in
+<a href = "ms_gen.html#ds_policy">Mapping-Semantics Genericity::Data Types as a Policy</a>.
+ </li>
+ <li> <tt>Eq_Fn</tt> is a key equivalence functor.</li>
+ <li> <tt>Update_Policy</tt> is a policy updating
+ positions in the list based on access patterns. It is described in
+ the following subsection.
+ </li>
+ <li> <tt>Allocator</tt> is (surprisingly) an allocator type.
+ </li>
+</ol>
+
+
+
+
+
+<h2><a name = "list_updates">List Updates</a></h2>
+
+<p>
+ This subsection describes list-update policies. It is organized as follows.
+</p>
+
+<ol>
+ <li> <a href = "#general">General Terms</a> describes general
+ terms.
+ </li>
+ <li> <a href = "#imp_pb_assoc">Implementation in <tt>pb_assoc</tt></a>
+ describes the implementation of these concepts in <tt>pb_assoc</tt>.
+ </li>
+</ol>
+
+
+
+
+<h3><a name = "general">General Terms</a></h3>
+
+
+<p>
+ For example, Figure
+<a href = "#lu">-A
+The counter algorithm
+</a>
+shows the counter algorithm. Each node contains both a key and a count metadata (shown in bold).
+When an element is accessed (<i>e.g.</i> 6)
+its count is incremented, as shown in
+Figure
+<a href = "#lu">
+The counter algorithm
+</a>-B.
+If the count reaches some predetermined value, say 10, as shown in
+Figure
+<a href = "#lu">
+The counter algorithm
+</a>-C,
+the count is set to 0
+and the node is moved to the front of the list, as in
+Figure
+<a href = "#lu">
+The counter algorithm
+</a>-D.
+
+
+</p>
+
+<h6 align = "center">
+<a name = "lu">
+<img src = "lu.jpg" width = "65%">
+</a>
+</h6>
+<h6 align = "center">
+The counter algorithm.
+</h6>
+
+
+
+<h3><a name = "imp_pb_assoc">Implementation in <tt>pb_assoc</tt></a></h3>
+
+<p>
+ The <tt>pb_assoc</tt> library allows instantiating lists with policies
+implementing any algorithm moving nodes to the front of the list (policies implementing
+algorithms interchanging nodes are currently unsupported).
+</p>
+
+<p>
+ Associative containers based on lists are parameterized by a <tt>Update_Policy</tt> parameter.
+This parameter defines the type of metadata each node contains, how to create the metadata, and how to
+decide, using this metadata, whether to move a node to the front of the list.
+ A list-based associative container object derives (publicly) from its update policy.
+</p>
+
+<p>
+ An instantiation of <tt>Update_Policy</tt> must define internally <tt>update_metadata</tt> as the metadata
+it requires. Internally, each node of the list contains, besides the usual key and data, an instance
+of <tt><b>typename</b> Update_Policy::update_metadata</tt>.
+</p>
+
+<p>
+ An instantiation of <tt>Update_Policy</tt> must define internally two operators:
+</p>
+<pre>
+update_metadata
+ <b>operator</b>()
+ ();
+
+<b>bool</b>
+ <b>operator</b>()
+ (update_metadata &);
+</pre>
+
+<p>
+ The first is called by the container object, when creating a new node, to create the node's metadata. The
+second is called by the container object, when a node is accessed (<i>e.g.</i>, when a find operation's key
+is equivalent to the key of the node), to determine whether to move the node to the front of the list.
+</p>
+
+<p>
+ Additionally, the library contains implementations of the move-to-front and counter policies. These
+are described in
+<a href="interface.html#policy_classes">Policy Classes</a>.
+</p>
+
+</body>
+
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/lu_cd.jpg b/libstdc++-v3/docs/html/ext/pb_assoc/lu_cd.jpg
new file mode 100644
index 0000000..c69cdc5
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/lu_cd.jpg
Binary files differ
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/lu_ds_tag.html b/libstdc++-v3/docs/html/ext/pb_assoc/lu_ds_tag.html
new file mode 100644
index 0000000..e906de7
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/lu_ds_tag.html
@@ -0,0 +1,74 @@
+
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+
+
+<html>
+<head>
+<title>lu_ds_tag Interface
+</title>
+
+</head>
+
+<body>
+<h1>
+<tt>lu_ds_tag
+</tt>
+
+ Interface
+
+
+</h1>
+
+<p>List-update data-structure tag.
+</p>
+
+<ol>
+<li>
+<a href = "../../../../include/ext/pb_assoc/ds_trait.hpp"><tt>ds_trait.hpp</tt>
+</a>
+
+</li>
+
+<li>
+<a href = "#link1">Base classes.
+</a>
+
+</li>
+
+</ol>
+
+
+<h2>
+<a name = "link1">Base classes.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "80%" ALIGN = "left"><b>Class</b></TD><TD Width = "20%" ALIGN = "left"><b>Derivation Type</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a href = "basic_ds_tag.html"><tt>basic_ds_tag</tt></a></pre>
+
+
+</td>
+
+<td>
+<p>public</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+
+
+</body>
+
+</html>
+
+
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/lu_ops.jpg b/libstdc++-v3/docs/html/ext/pb_assoc/lu_ops.jpg
new file mode 100644
index 0000000..fa26e84
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/lu_ops.jpg
Binary files differ
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/mmap_value_utils.html b/libstdc++-v3/docs/html/ext/pb_assoc/mmap_value_utils.html
new file mode 100644
index 0000000..dd0846e
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/mmap_value_utils.html
@@ -0,0 +1,128 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+<HTML>
+<HEAD>
+ <TITLE>Multimap Value-Type Utilities</TITLE>
+ <META NAME="Generator" content="Microsoft Visual Studio .NET 7.1">
+</HEAD>
+<BODY>
+
+<H1>Multimap Value-Type Utilities</H1>
+
+<p>
+ In <tt>pb_assoc</tt>, associative containers have a unique-key design.
+Multimaps, consequently are maps of sets, <i>e.g.</i>,
+a <a href = "cc_ht_multimap.html"><tt>cc_ht_multimap</a>&lt;<b>int</b>, <b>char</b>&gt;</tt>
+object maps <tt><b>int</b></tt>s to sets of <tt><b>char</b></tt>s.
+ It is often convenient to perform
+value-type operations on multimaps, <i>e.g.</i>, in this case, to find a specific
+<tt>std::pair&lt;<b>int</b>, <b>char</b>&gt;</tt> object (say, <tt>std::make_pair(2, 'b')</tt>)
+in a multimap object. These types of operations involve typically two steps: in the
+first step, some operation is performed on the multimap object itself, and in the second
+step, some operation is performed on the multimap's pertinent set object.
+(This is true for the STL's multimaps as well, except that the "set" is an implicit
+list.)
+</p>
+
+<p>
+ Coding these two-step operations is repetitious and error prone.
+ <tt>pb_assoc</tt> containers already maintain the invariant that they support
+a value-type method for any mapped-value-type method they support
+(hence any multimap of the above type supporsts a method for inserting
+ <tt>std::make_pair(2, 'b')</tt>). Following are some utility functions for
+ other common operations.
+</p>
+
+
+<pre>
+<b>template</b>&lt;
+ <b>class</b> MMap_Cntnr&gt;
+<b>inline</b> std::pair&lt;
+ <b>typename</b> MMap_Cntnr::mapped_data_type::find_iterator,
+ <b>bool</b>&gt;
+ mmap_value_find
+ (<b>const</b> MMap_Cntnr &r_mmap_cntnr,
+ <b>typename</b> MMap_Cntnr::const_reference r_val);
+</pre>
+
+<p>
+ Finds the (const reference to a) value-type
+<font color = "#666666"><tt>r_val</tt></font> in
+the multimap object
+<font color = "#666666"><tt>r_mmap_cntnr</tt></font>.
+</p>
+<p>
+ It
+returns a pair whose first entry is a find-type iterator
+of the multimap's set type, and whose second entry is a boolean
+indicating whether the value type was found (only in this
+case is the first entry in the pair valid).
+</p>
+
+<pre>
+<b>template</b>&lt;
+ <b>class</b> MMap_Cntnr&lt;
+<b>inline</b> <b>typename</b> MMap_Cntnr::size_type
+ mmap_value_erase
+ (MMap_Cntnr &r_mmap_cntnr,
+ <b>typename</b> MMap_Cntnr::const_reference r_val,
+ <b>bool</b> erase_entry_if_last);
+</pre>
+
+<p>
+ Transactionally erases the (const reference to the) value-type
+<font color = "#666666"><tt>r_val</tt></font> from
+the multimap object
+<font color = "#666666"><tt>r_mmap_cntnr</tt></font>, and
+erases the mapped value type
+with
+<font color = "#666666"><tt>r_val</tt></font>'s key
+if there are no more value types with this given key
+and
+<font color = "#666666"><tt>erase_entry_if_last</tt></font> <tt>= <b>true</b></tt>.
+<p>
+</p>
+ It
+returns 1 if a value type was actually erased, or 0 otherwise.
+</p>
+
+<pre>
+<b>template</b>&lt;
+ <b>class</b> MMap_Cntnr&gt;
+<b>inline</b> std::pair&lt;
+ <b>typename</b> MMap_Cntnr::mapped_data_type::find_iterator,
+ <b>bool</b>>
+ mmap_value_replace
+ (MMap_Cntnr &r_mmap_cntnr,
+ <b>typename</b> MMap_Cntnr::const_reference r_val,
+ <b>typename</b> MMap_Cntnr::const_data_reference r_data);
+</pre>
+
+<p>
+ Transactionally erases
+<font color = "#666666"><tt>r_val</tt></font>
+from
+<font color = "#666666"><tt>r_mmap_cntnr</tt></font>
+(if it such a value type exists) and
+inserts instead a value type whose key is
+<font color = "#666666"><tt>r_val</tt></font><tt>.first</tt>
+and whose data is
+<font color = "#666666"><tt>r_data</tt></font>.
+</p>
+<p>
+<p>
+ It
+returns a pair whose first entry is a find-type iterator
+of the multimap's set type, and whose second entry is a boolean
+indicating whether the new value type was inserted
+(it might have
+existed previously).
+</p>
+
+<p>
+(If the multimap type or its set type do not guarantee exception free
+erases, <tt>mmap_value_erase</tt> and <tt>mmap_value_replace</tt> will
+invalidate pointers, references, and iterators).
+</p>
+
+</BODY>
+</HTML>
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/motivation.html b/libstdc++-v3/docs/html/ext/pb_assoc/motivation.html
new file mode 100644
index 0000000..11eca4a
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/motivation.html
@@ -0,0 +1,281 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+<html>
+ <head>
+ <title>Motivation</title>
+ <meta name="GENERATOR" content="Microsoft Visual Studio .NET 7.1">
+ <meta name="vs_targetSchema" content="http://schemas.microsoft.com/intellisense/ie5">
+ </head>
+<body bgcolor = "white">
+<h1>Motivation</h1>
+
+<p>
+ The <a href = "introduction.html">Introduction</a> Section described some challenges
+in designing associative containers. This section describes the STL's solution and motivation for an alternative solution. It is organized as follows.
+</p>
+
+<ol>
+ <li> <a href = "#stl">The STL's Associative-Container Design</a>
+ briefly describes the STL's solution.
+ </li>
+ <li> <a href = "#policies">Choice of Policies</a> discusses possible additional policies by which to parameterize data structures.
+ </li>
+ <li> <a href = "#ds_genericity">Data-Structure Genericity</a> discusses possible problems with generic manipulation of containers based on different underlying data-structures.
+ </li>
+ <li> <a href = "#mapping_semantics">Mapping Semantics</a> discusses scalability issues with the STL's non-unique-mapping associative containers.
+ </li>
+ <li> <a href = "#methods">Choice of Methods</a> discusses some reservations with the choice of methods in the STL.
+ </li>
+</ol>
+
+<h2><a name = "stl">The STL's Associative-Container Design</a></h2>
+
+<p>
+ The STL (or its extensions) currently offer associative containers based on underlying red-black trees or collision-chaining hash tables. For association, containers based on trees are parameterized by a comparison functor, and containers based on hash tables are parameterized by a hash functor and an equivalence functor.
+</p>
+
+<p>
+ For each underlying data-structure, the STL offers four containers with different mapping semantics. A map-type uniquely maps each key to some datum, a set-type stores uniquely keys, a multimap-type non-uniquely maps each key to some datum, and a multiset-type non-uniquely stores keys.
+</p>
+
+<p>
+ Containers contain various iterator-based methods. <i>E.g.</i>, all containers have constructors taking a pair of iterators, and transactionally construct an object containing all elements in the iterators' range. Additionally, it is possible to (non-transactionally) insert a range given by iterators, or erase such a range. Other methods are implicitly range-based, <i>e.g.</i>, it is possible to test the equivalence of two associative container objects via <tt><b>operator</b>==</tt>.
+</p>
+
+<h2><a name = "policies">Choice of Policies</a></h2>
+
+<p>
+ In order to function efficiently in various settings, associative containers require
+a wide variety of policies.
+</p>
+
+<p>
+ For example, a hash policy instructs how to transform a key object into some non-negative integral type; <i>e.g.</i>, a hash functor might transform <tt>"hello"</tt> into <tt>1123002298</tt>. A hash table, though, requires transforming each key object into some non-negative integral type in some specific domain; <i>e.g.</i>, a hash table with 128 entries might transform the <tt>"hello"</tt> into position 63. The policy by which the hash value is transformed into a position within the table can dramatically affect performance.
+</p>
+
+<p>
+ Additionally, most hash-table algorithms encounter collisions. To mitigate the cost of these collisions, it sometimes is beneficial to store the hash value along with each element
+[<a href = "references.html#clrs2001">clrs2001</a>, <a href = "references.html#austern01htprop">austern01htprop</a>]. While this improves performance for complex keys, it hampers performance for simple keys, and is best left as a policy.
+</p>
+
+<p>
+ Tree-based containers allow reasonable access while maintaining order between elements. In some cases, however, tree-based containers can be used for additional purposes. <i>E.g.</i>,consider Figure
+<a href = "#interval_invariants">
+Sets of line intervals
+</a>-A,
+which shows
+an example of a tree-based set storing
+half-open geometric line intervals. An <tt>std::set</tt> with this
+structure can efficiently answer whether <i>[20, 101)</i> is in the
+set, but it cannot efficiently answer whether any interval in the
+set overlaps <i>[20, 101)</i>, nor can it efficiently enumerate all
+intervals overlapping <i>[20, 101)</i>. A well-known augmentation to
+balanced trees can support efficient answers to such questions
+[<a href = "references.html#clrs2001">clrs2001</a>]. Namely,
+an invariant should be maintained whereby
+each node should contain also the
+maximal endpoint of any interval within its subtree, as in Figure
+<a href = "#interval_invariants">
+Sets of line intervals
+</a>-B. In order to maintain this ivariant, though, an invariant-restoring policy is
+required.
+</p>
+
+<h6 align = "center">
+<a name = "interval_invariants">
+<img src = "interval_node_invariants.jpg" width = "70%" alt = "no image">
+</a>
+</h6>
+<h6 align = "center">
+Sets of line intervals.
+</h6>
+
+
+<h2><a name = "ds_genericity">Data-Structure Genericity</a></h2>
+
+<p>
+ Consider a generic function manipulating an associative container, <i>e.g.</i>,
+</p>
+
+<pre>
+<b>template</b>&lt;
+ <b>class</b> Cntnr&gt;
+<b>int</b> some_op_sequence
+ (Cntnr &r_cnt)
+{
+ ...
+}
+</pre>
+
+<p>
+ The underlying data structure affects what the function can do with the container object.
+</p>
+
+<p>
+ For example, if <tt>Cntnr</tt> is <tt>std::map</tt>, then the function can
+use <tt>std::for_each(r_cnt.find(foo), r_cnt.find(bar), foobar)</tt>
+in order to apply <tt>foobar</tt> to all elements between <tt>foo</tt>
+and <tt>bar</tt>. If <tt>Cntnr</tt> is a hash-based container, then this call's results are undefined.
+</p>
+
+<p>
+ Also, if <tt>Cntnr</tt> is tree-based, the type and object of the comparison functor
+can be accessed. If <tt>Cntnr</tt> is hash based, these queries are nonsensical</p>
+
+<p>
+ These types of problems are excaberated when considering the wide variety of useful underlying data-structures. Figure
+<a href = "#different_underlying_data_structures">Different underlying data structures</a>
+shows different underlying data-structures (the ones
+currently supported in <tt>pb_assoc</tt>). A shows a collision-chaining hash-table; B shows a probing hash-table; C shows a red-black tree; D shows a splay tree; E shows a tree based on an ordered vector (the tree is implicit in the order of the elements); E shows a list-based container with update policies.
+</p>
+
+<h6 align = "center">
+<a name = "different_underlying_data_structures">
+<img src = "different_underlying_dss.jpg" width = "70%" alt = "no image">
+</a>
+</h6>
+<h6 align = "center">
+Different underlying data structures.
+</h6>
+
+<p>
+ These underlying data structures display different behavior. For one, they can be queried for different policies. Furthermore:
+</p>
+<ol>
+ <li>
+ Containers based on C, D, and E store eleents in a meaningful order; the others store elements in a meaningless (and probably time-varying) order. As a futher consequence, containers based on C, D, and E can support erase operations taking an iterator and returning an iterator to the following element; the others cannot.
+ </li>
+ <li>
+ Containers based on C, D, and E can be split and joined efficiently, while the others cannot. Containers based on C and D, futhermore, can guarantee that this is exception-free; containers based on E cannot guarantee this.
+ </li>
+ <li>
+ Containers based on all but E can guarantee that erasing an element is exception free; containers based on E cannot guarantee this. Containers based on all but B and E can guarantee that modifying an object of their type does not invalidate iterators or references to their elements, while contianers based on B and E cannot. Containers based on C, D, and E can futhermore make a stronger guarantee, namely that modifiying an object of their type does not affect the relation of iterators.
+ </li>
+</ol>
+
+<p>
+ A unified tag and traits system (as used for the STL's iterators, for example) can ease generic manipulation of associative containers based on different underlying data-structures.
+</p>
+
+<h2><a name = "mapping_semantics">Mapping Semantics</a></h2>
+
+ <p>
+ In some cases, map and set semantics are inappropriate. <i>E.g.</i>, consider
+an application monitoring user activity. Such an application might be designed to track a user, the machine(s) to which the user is logged, application(s) the user is running on the machine, and the start time of the application. In this case, since a user might run more than a single application, there can be no unique mapping from a user to specific datum.
+ </p>
+
+<p>
+ The STL's non-unique mapping containers (<i>e.g.</i>,
+<tt>std::multimap</tt> and <tt>std::multiset</tt>) can be used
+in this case. These types of containers can store store two or more equivalent, non-identical keys [<a href = "references.html#kleft00sets">kleft00sets</a>]. Figure
+<a href = "#embedded_lists_1">Non-unique mapping containers in the STL's design</a> shows possible structures of STL tree-based and hash-based containers, multisets, respectively; in this figure, equivalent-key nodes share the same shading.
+</p>
+
+<h6 align = "center">
+<a name = "embedded_lists_1">
+<img src = "embedded_lists_1.jpg" width = "70%" alt = "no image">
+</a>
+</h6>
+<h6 align = "center">
+Non-unique mapping containers in the STL's design.
+</h6>
+
+<p>
+ This design has several advantages. Foremost, it allows maps and multimaps, and sets and multisets, to share the same <tt>value_type</tt>, easing generic manipulation of containers with different mapping semantics.
+</p>
+
+
+<p>
+ Conversely, this design has possible scalability drawbacks, due to an implicit "embedding" of linked lists.
+Figure
+<a href = "#embedded_lists_2">
+Embedded lists in STL multimaps
+</a>-A shows a tree with shaded nodes sharing equivalent keys;
+Figure
+<a href = "#embedded_lists_2">
+Embedded lists in STL multimaps
+</a>-A explicitly shows the linked lists implicit in Figure
+<a href = "#embedded_lists_1">Non-unique mapping containers in the STL's design</a>. The drawbacks are the following.
+</p>
+
+<ol>
+ <li> As mentioned before, there are several underlying data-structures, each with its set of tradeoffs.
+The STL's design uses an associative linked-list to store all elements with equivalent primary
+key (<i>e.g.</i>, users). Searching for a secondary key (<i>e.g.</i>,
+a process) is inherently linear. While this works reasonably well when the number of distinct secondary
+keys is small, it does not scale well.
+ </li>
+ <li> Embedding linked lists can cause the entire structure to be inefficient.
+<i>E.g.</i>, Figure
+<a href = "#embedded_lists_1">
+Effect of embedded lists in STL multimaps
+</a>-A
+ shows a tree with several shaded nodes containing equivalent keys; note how unbalanced
+this tree would seem when considering all shaded nodes to be a single node.
+Figure
+<a href = "#embedded_lists_1">
+Effect of embedded lists in STL multimaps
+</a>-B shows a hash table with several shaded nodes containing equivalent keys; note
+that this can lengthen the search for other nodes as well.
+ </li>
+ <li> Embdedding linked lists is only possible for some data structures.
+Some data structures, <i>e.g.</i>, probing-hash tables, linear hash tables,
+and extendible hash tables, cannot support it.
+ </li>
+ <li> The embedded linked list design forgoes the abilitiy to treat
+all elements with the same primary key as a single entity. The ability to
+efficiently simultaneously insert (or erase) a larger number of elements with
+the same primary key is lost; the ability to utilize segmented iterators is lost
+[<a href = "references.html#austern98segmented">austern98segmented</a>].
+ </li>
+ <li> The linked-list design uses much space. For one, in the above example, the data identifying will must be duplicated for each application run by the user. Furthermore, the "links" in the linked list are supplied by the underlying data structure. In the case of tree-based containers, for example, the linked list utilizes the fact that each tree node contains pointers to its parent and its children; given that the order of equivalent keys is meaningless, the number of pointers exceeds the functionality supplied by a linked list.
+ </li>
+</ol>
+
+<h6 align = "center">
+<a name = "embedded_lists_2">
+<img src = "embedded_lists_2.jpg" width = "70d" alt = "no image">
+</a>
+</h6>
+<h6 align = "center">
+Embedded lists in STL multimaps.
+</h6>
+
+
+<h2><a name = "methods">Choice of Methods</a></h2>
+
+<p>
+ [<a href = "references.html#meyers02both">meyers02both</a>] points out
+that a class's methods should comprise only operations which depend on the class's internal structure; other operations are best designed as external functions. Possibly, therefore, the STL's associative containers lack some useful methods, and provide some redundant methods.
+</p>
+
+<ol>
+ <li>
+ Possibly missing methods:
+ </li>
+ <ol>
+ <li>
+ It is well-known that tree-based container objects can be efficiently split or joined
+ [<a href = "references.html#clrs2001">clrs2001</a>]. Externally splitting or joining trees is super-linear, and, furthermore, can throw exceptions. Split and join methods, consequently, seem good choices for tree-based container methods.
+ </li>
+ <li>
+ Suppose all elements which match a certain criteria need to be erased from an
+unordered container object, <i>e.g.</i>, all elements whos keys are in a given range. Externally erasing them from the container object is super-linear, since erasing an element might reorder all iterators. Conditional erasing, therefore, seems a good choice for associative containers.
+ </li>
+ </ol>
+ <li> Possibly redundant methods:</li>
+ <ol>
+ <li>
+ STL associative containers provide methods for inserting a range of elements given by a pair of iterators. At best, this can be implemented as an external function, or, even more efficiently, as a join operation (for the case of tree-based containers). Moreover, these methods seem similar to constructors taking a range given by a pair of iterators; the constructors, however, are transactional, whereas the insert methods are not; this is possibly confusing.
+ </li>
+ <li>
+ STL associative containers provide methods for erasing a range of elements given by a pair of iterators. At best, this can be implemented as an external function, or, even more efficiently, as a (small) sequence of split and join operations (for the case of tree-based containers). Moreover, the results of erasing a range is undefined for the case of containers based on unordered data-structures.
+ </li>
+ <li>
+ Associative containers are parameterized by policies allowing to test keys, but not data, for equivalence. When comparing two associative container objects, it is at least as reasonable to expect that they are equivalent if both keys and data are equivalent, as it is reasonable to expect that they are equivalent if their keys only are equivalent. Furthermore, in different settings it makes sense that two objects are equivalent if they store keys in the same order, whereas in other settings order does not matter. The operators <tt>operator==</tt> and <tt>operator!=</tt> are not descriptive enough for these considerations.
+ </li>
+ </ol>
+</ol>
+
+</body>
+
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/move_to_front_update_metadata.html b/libstdc++-v3/docs/html/ext/pb_assoc/move_to_front_update_metadata.html
new file mode 100644
index 0000000..8a73408
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/move_to_front_update_metadata.html
@@ -0,0 +1,41 @@
+
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+
+
+<html>
+<head>
+<title>move_to_front_update_metadata Interface
+</title>
+
+</head>
+
+<body>
+<h1>
+<tt>move_to_front_update_metadata
+</tt>
+
+ Interface
+
+
+</h1>
+
+<p>A list-update metadata type that unconditionally moves elements to the front of the list.
+</p>
+
+<ol>
+<li>
+<a href = "../../../../include/ext/pb_assoc/move_to_front_update_policy.hpp"><tt>move_to_front_update_policy.hpp</tt>
+</a>
+
+</li>
+
+</ol>
+
+
+
+
+</body>
+
+</html>
+
+
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/move_to_front_update_policy.html b/libstdc++-v3/docs/html/ext/pb_assoc/move_to_front_update_policy.html
new file mode 100644
index 0000000..f9a47e3
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/move_to_front_update_policy.html
@@ -0,0 +1,256 @@
+
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+
+
+<html>
+<head>
+<title>move_to_front_update_policy Interface
+</title>
+
+</head>
+
+<body>
+<h1>
+<tt>move_to_front_update_policy
+</tt>
+
+ Interface
+
+
+</h1>
+
+<p>A list-update policy that unconditionally moves elements to the front of the list.
+</p>
+
+<ol>
+<li>
+<a href = "../../../../include/ext/pb_assoc/move_to_front_update_policy.hpp"><tt>move_to_front_update_policy.hpp</tt>
+</a>
+
+</li>
+
+<li>
+<a href = "#link1">Template parameters.
+</a>
+
+</li>
+
+<li>
+Public Methods:
+
+
+<ol>
+<li>
+<a href = "#link2">Constructors, destructor, and related.
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+<li>
+Protected Types and Constants:
+
+
+<ol>
+<li>
+<a href = "#link3">Metadata definitions.
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+<li>
+Protected Methods:
+
+
+<ol>
+<li>
+<a href = "#link4">Metadata operations.
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+</ol>
+
+
+<h2>
+<a name = "link1">Template parameters.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "20%" ALIGN = "left"><b>Parameter</b></TD><TD Width = "50%" ALIGN = "left"><b>Description</b></TD><TD Width = "30%" ALIGN = "left"><b>Default Value</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "Metadata_Reference3735929465">Metadata_Reference</a></pre>
+
+
+</td>
+
+<td>
+<p>Metadata reference type.</p>
+
+
+</td>
+
+<td>
+<pre>std::allocator&lt;
+ <a href = "move_to_front_update_metadata.html"><tt>move_to_front_update_metadata</tt></a>&gt;::
+ reference
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link2">Constructors, destructor, and related.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>void</b>
+ swap
+ (<font color = "olive">move_to_front_update_policy</font> &amp;r_other)</pre>
+
+
+</td>
+
+<td>
+<p>Swaps content.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link3">Metadata definitions.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "30%" ALIGN = "left"><b>Type</b></TD><TD Width = "55%" ALIGN = "left"><b>Definition</b></TD><TD Width = "15%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "metadata_type3735929937">metadata_type</a></pre>
+
+
+</td>
+
+<td>
+<pre><a href = "move_to_front_update_metadata.html"><tt>move_to_front_update_metadata</tt></a></pre>
+
+
+</td>
+
+<td>
+<p>Metadata on which this functor operates.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "metadata_reference3735929497">metadata_reference</a></pre>
+
+
+</td>
+
+<td>
+<pre><a href = "#Metadata_Reference3735929465">Metadata_Reference</a></pre>
+
+
+</td>
+
+<td>
+<p>Reference to metadata on which this functor operates.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link4">Metadata operations.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a href = "#metadata_type3735929937">metadata_type</a>
+ <b>operator</b>()
+ () <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Creates a metadata object.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>bool</b>
+ <b>operator</b>()
+ (<a href = "#metadata_reference3735929497">metadata_reference</a> r_data) <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Decides whether a metadata object should be moved to the front of the list.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+
+
+</body>
+
+</html>
+
+
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/ms_cd.jpg b/libstdc++-v3/docs/html/ext/pb_assoc/ms_cd.jpg
new file mode 100644
index 0000000..885319da
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/ms_cd.jpg
Binary files differ
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/ms_gen.html b/libstdc++-v3/docs/html/ext/pb_assoc/ms_gen.html
new file mode 100644
index 0000000..468c121
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/ms_gen.html
@@ -0,0 +1,440 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+<html>
+ <head>
+ <title>Mapping-Semantics Genericity</title>
+ <meta name="GENERATOR" content="Microsoft Visual Studio .NET 7.1">
+ <meta name="vs_targetSchema" content="http://schemas.microsoft.com/intellisense/ie5">
+ </head>
+<body bgcolor = "white">
+
+
+<h1>Mapping-Semantics</h1>
+
+<p>
+ This section describes genericity over different mapping-semantics. It is organized as follows.
+</p>
+<ol>
+ <li><a href = "#intro">Introduction</a></li>
+ <li><a href = "#ds_policy">Data Types as a Policy</a></li>
+ <li><a href = "#problem">The Basic Problem</a></li>
+ <li><a href = "#mapping_level">Mapping Levels</a></li>
+ <li><a href = "#ms_traits">Tags and Traits</a></li>
+ <li><a href = "#drawbacks">Drawbacks</a></li>
+</ol>
+
+
+<h2><a name = "intro">Introduction</a></h2>
+
+<p>
+<a href = "motivation.html#mapping_semantics">Motivation::Mapping Semantics</a> discussed scalability issues with the STL's non-unique-mapping associative containers; non-unique association inherently embeds linked-lists in associative containers resulting in scalability problems and other problems.
+</p>
+
+<p>
+ In <tt>pb_assoc</tt>, all containers have unique-key semantics. Each key is uniquely mapped to &quot;something&quot;.
+</p>
+
+
+<h2><a name = "ds_policy">Data Types as a Policy</a></h2>
+
+<p>
+ All associative-containers in <tt>pb_assoc</tt> are parameterized by a data type.
+<i>E.g.,</i> <a href = "cc_hash_assoc_cntnr.html">cc_hash_assoc_cntnr</a> is parameterized as
+</p>
+<pre>
+<b>template</b>&lt;
+ <b>typename</b> Key,
+ <b>typename</b> Data,
+ ...&gt;
+<b>class</b> <a href = "cc_hash_assoc_cntnr.html">cc_hash_assoc_cntnr</a>;
+</pre>
+
+<p>
+ There are no separate classes for maps, sets, multimaps, and multisets (as the STL has). Rather, the mapping-semantic is set by specifying the <tt>Key</tt> parameter.
+</p>
+
+<ol>
+ <li> If <tt>Data</tt> is any type (<i>e.g.</i>, <tt><b>int</b></tt> or
+<tt>std::string</tt>), then the container is a &quot;map&quot; - it maps each <tt>Key</tt> object to a <tt>Data</tt> object.
+ </li>
+ <li> If <tt>Data</tt> is
+<a href = "null_data_type.html"><tt>null_data_type</tt></a>,
+then the container is a &quot;set&quot; - it stores each <tt>Key</tt> object. In this case, each <tt>Key</tt> object is not really mapped to anything (except, implicitly, to the fact that it is stored in the container object).
+ </li>
+ <li>
+ If <tt>Data</tt> is
+<a href = "compound_data_type.html">compound_data_type</a><tt>&lt;Cntnr&gt;</tt>,
+then the container is a &quot;multimap&quot; - it maps each <tt>Key</tt> object into a <tt>Cntnr</tt> object. This structure is recursive - <tt>Cntnr</tt> itself can be a &quot;map&quot;, &quot;set&quot;, &quot;multimap&quot;, and so forth.
+ </li>
+</ol>
+
+<p>
+ Each container derives from one of the three containers
+in the oval of Figure
+<a href = "#ms_cd">
+Data-types as a policy
+</a>.
+</p>
+
+ <ol>
+ <li><a href = "basic_assoc_cntnr.html"><tt>basic_assoc_cntnr</tt></a>
+is the base for most instantiations of a container's <tt>Data</tt> paramter. This
+base includes the definition of <tt>data_type</tt>, and supports
+<tt><b>operator</b>[]</tt>.
+ </li>
+ <li><a href = "basic_assoc_cntnr_no_data.html"><tt>basic_assoc_cntnr</tt></a> is the base for a
+<a href = "null_data_type"><tt>null_data_type</tt></a> instantiation of a container's <tt>Data</tt> paramter. This
+base lacks the definition of <tt>data_type</tt>, and does not support
+<tt><b>operator</b>[]</tt>.
+ <li><a href = "basic_assoc_cntnr_compound_data.html"><tt>basic_assoc_cntnr</tt></a> is the base for a
+<a href = "compound_data_type.html"><tt>compound_data_type</tt></a><tt>&lt;Cntnr&gt;</tt> instantiation of a container's <tt>Data</tt> paramter. This
+base includes the definition of <tt>data_type</tt>, and supports
+<tt><b>operator</b>[]</tt>. It further supports some advanced functionality described in the remainder of this section.
+ </ol>
+
+
+<h6 align = "center">
+<a name = "ms_cd">
+<img src = "ms_cd.jpg" width = "70%" alt = "no image">
+</h6>
+</a>
+<h6 align = "center">
+Data-types as a policy.
+</h6>
+
+
+<h2><a name = "problem">The Basic Problem</a></h2>
+
+<p>
+ Consider a <tt>pb_assoc</tt> &quot;multimap&quot; mapping integers to characters.
+Since a <tt>pb_assoc</tt> &quot;multimap&quot; is a &quot;map&quot; of &quot;sets&quot;,
+if <tt>m</tt> is an object of this type, it is not possible to directly use
+<tt>m.insert(std::make_pair(2, 'b')</tt> (however, it is possible to directly use
+<tt>m[2].insert('b')</tt>). In would be nice if this method whould be supported.
+</p>
+
+<p>
+ Put differently, while the <tt>pb_assoc</tt> &quot;multimap&quot; can be viewed logically as the collection
+</p>
+<p>
+ { <tt><b>int</b></tt> &rarr; {<tt><b>char</b></tt>} },
+</p>
+<p>
+ It would be nice if it could simultaneously be viewed as the collection
+</p>
+<p>
+ { (<tt><b>int</b></tt>, <tt><b>char</b></tt>) },
+</p>
+<p><i>i.e.</i>, a &quot;set&quot; of pairs.</p>
+
+<p>
+ In more general terms, it would be nice to be able to simultaneously
+view a collection
+</p>
+<p>
+{ key_type_0 &rarr; { key_type_1 &rarr; { key_type_2 &rarr; { key_type_3 &rarr; { ... }}}}}
+</p>
+<p>
+as each of the following:
+</p>
+<p>
+{ (key_type_0, key_type_1) &rarr; { key_type_2 &rarr { key_type_e &rarr; { ... }}}},
+</p>
+<p>
+{ (key_type_0, key_type_1, key_type_2) &rarr { key_type_3 &rarr; { ... }}}
+</p>
+<p>
+{ (key_type_0, key_type_1, key_type_2, key_type_3 ) &rarr { }}
+</p>
+<p>
+...
+</p>
+
+
+<p>
+<a href = #mapping_level">Mapping_Levels</a> discusses the mechanism
+for these multiple views in <tt>pb_assoc</tt>
+</p>
+
+
+
+<h2><a name = "mapping_level">Mapping Levels</a></h2>
+
+<p>
+ Each associative container in <tt>pb_assoc</tt> has
+a <i>mapping level</i>. The mapping level is defined by
+the instantiation of a container's <tt>Data</tt>
+parameter:
+</p>
+
+<ol>
+ <li> If the <tt>Data</tt> parameter is instantiated
+by
+<a href = "null_data_type.html"><tt>null_data_type</tt></a> (<i>i.e.</i>,
+the container is a &quot;set&quot;), then the mapping level is 1.
+ </li>
+ <li> If the <tt>Data</tt> parameter is instantiated
+by
+<a href = "compound_data_type.html">compound_data_type</a><tt>&lt;Cntnr&gt;</tt>
+(<i>i.e.</i>, the container is a &quot;multimap&quot;), then the mapping level
+is 1 + the mapping level of <tt>Cntnr</tt>.
+ </li>
+ <li> If the <tt>Data</tt> parameter is instantiated
+by any other type, <i>e.g.</i>, <tt><b>char</b></tt> (<i>i.e.</i>,
+the container is a &quot;map&quot;), then the mapping level is 1.
+ </li>
+</ol>
+
+<p>
+ Containers can be rebound, at compile time, to different mapping levels.
+The compound data-type specialization <a href = "basic_assoc_cntnr_compound_data.html"><tt>basic_assoc_cntnr</tt></a>
+defines internally
+</p>
+<pre>
+<b>template</b>&lt;
+ <b>int</b> Mapping_Level&gt;
+<b>struct</b> rebind
+{
+ <b>typedef</b>
+ ...
+ other;
+};
+</pre>
+
+<p>
+(which is similar to the STL's allocator rebind mechanism).
+the type <tt>other</tt> is the view of the container with mapping
+level <tt>Mapping_Level</tt>. The container can be safely cast
+to <tt>other</tt>.
+</p>
+
+<p>
+ As an example, consider the type
+</p>
+
+<pre>
+<b>typedef</b>
+ <a href = "cc_hash_assoc_cntnr.html">cc_hash_assoc_cntnr</a>&lt;
+ <b>int</b>,
+ <a href = "compound_data_type.html">compound_data_type</a>&lt;
+ <a href = "tree_assoc_cntnr.html">tree_assoc_cntnr</a>&lt;
+ <b>char</b>,
+ <a href = "null_data_type.html"><tt>null_data_type</tt></a>&gt; &gt; &gt;
+ cntnr_t;
+</pre>
+<p>
+ which is a &quot;map&quot; mapping each <tt><b>int</b></tt> to
+a &quot;set&quot; of <tt><b>char</b></tt>s. In this case, <tt>cntnr_t</tt> has mapping level 2.
+</p>
+
+<p>
+ An object of type <tt>cntnr_t</tt> cannot support <tt>insert(std::make_pair(2, 'b'));</tt>. On the other hand, the following code snippet shows how to do so:
+</p>
+
+<pre>
+cntnr_t c;
+
+<b>typedef</b>
+ t::rebind<1>::other
+ t_;
+
+((t_ &)c).insert(std::make_pair(2, 'b'));
+</pre>
+
+
+<p>
+<a href = "../example/mapping_level_example.cpp"><tt>mapping_level_example.cpp</tt></a> shows a more detailed example.
+</p>
+
+
+
+<h2><a name = "ms_traits">Tags and Traits</a></h2>
+
+<p>
+ It is, of course, beneficial to query types for their mapping semantics.
+</p>
+
+<p>
+ Each container defines internally the type <tt>ms_category</tt>
+as its mapping-semantics tag (hopefully this name is not copyrighted
+by some major corporation). The possible tags, shown in Figure
+
+are the following:
+</p>
+
+<ol>
+ <li>
+ <a href = "basic_ms_tag.html"><tt>basic_ms_tag</tt></a>
+is a basic mapping-semantics tag. It is the type defined by &quot;set&quot;s.
+ </li>
+ <li>
+ <a href = "data_enabled_ms_tag.html"><tt>data_enabled_ms_tag</tt></a>
+is a mapping-semantics tag of types that have data. It is the type defined by &quot;map&quot;s.
+ </li>
+ <li>
+ <a href = "compound_data_enabled_ms_tag.html"><tt>compound_data_enabled_ms_tag</tt></a>
+is a mapping-semantics tag of types that have compound data. It is the type defined by &quot;multimap&quot;s.
+ </li>
+</ol>
+
+<p>
+ Additionally, a container's mapping semantics can be queried by traits. For any
+container <tt>Cntnr</tt>,
+</p>
+
+<pre>
+<a href = "ms_traits.html">ms_traits</a>&lt;Cntnr&gt;::mapping_level
+</pre>
+
+<p>
+ indicates the mapping level of the container, for example.
+</p>
+
+
+
+<h2><a name = "drawbacks">Drawbacks</a></h2>
+
+<tt>pb_assoc</tt>'s mapping-semantics design has some drawbacks compared to that of the STL.
+
+
+<h3>Equivalent, Non-Identical Keys</h3>
+
+<p>
+ The STL's multimaps and multisets allow storing equivalent, non-identical keys
+[<a href = "references.html#kleft00sets">kleft00sets</a>]. For example, assume a bank maintains a data structure monitoring the accounts opened by each person. This could be modeled as the following:
+</p>
+
+<pre>
+<i>// Name type.</i>
+<b>typedef</b>
+ std::string
+ name;
+
+<i>// Account-id type.</i>
+<b>typedef</b>
+ <b>unsigned long</b>
+ account_id;
+
+<i>// Association between a name and an account id.</i>
+<b>class</b> opened_info
+{
+<b>public</b>:
+ ...
+
+ <i>// Comparison operator.</i>
+ <b>bool</b>
+ <b></b>operator&lt;</b>
+ (<b>const</b> opened_info &r_other)
+ {
+ <i>Comparison is defined as the comparison of the names.</i>
+ <b>return</b> m_name < r_other.m_name;
+ }
+
+
+<b>private</b>:
+ name m_name;
+
+ account_id m_acc_id;
+};
+
+<i>// A multiset of opened accounts.</i>
+<b>typedef</b>
+ std::multiset&lt;
+ opened_info&gt;
+ all_opened_info;
+</pre>
+
+<p>
+ <tt>std::multiset</tt> can accomodate multiple equivalent, non-identical <tt>opened_info</tt> - those with the same name but different account id.
+</p>
+
+<p>
+ In <tt>pb_assoc</tt>, however, non-unique mapping is unsupported. The equivalent to the above could be
+</p>
+
+<pre>
+<b>typedef</b>
+ tree_assoc_cntnr&lt;
+ name,
+ compound_data_type&lt;
+ cc_hash_assoc_cntnr&lt;
+ account_id&gt; &gt; &gt;
+ all_opened_info;
+</pre>
+
+<p>
+ The drawback lies in the fact that the data stored in
+<tt>all_opened_info</tt> is less encapsulated - an <tt>opened_info</tt>
+object needs to be constructed when a specific name and account are found, and
+an <tt>opened_info</tt> object needs to be decomposed into <tt>name</tt> and
+<tt>account_id</tt> objects when it is inserted into a <tt>all_opened_info</tt>
+object.
+</p>
+
+<p>
+ It should be noticed however, that the above drawbacks - construction and decomposition are constant-time additive drawbacks. The drawbacks of the
+STL's associative containers are in terms of orders of growth.
+</p>
+
+<h3>Definition of <tt>value_type</tt></h3>
+
+<p>
+ The STL's associative containers contain a pleasingly uniform definition of
+the <tt>value_type</tt> of a container.
+If a container is parameterized by <tt>key</tt> as its <tt>Key</tt>, and <tt>data</tt> as its <tt>Data</tt>, then its <tt>value_type</tt> is
+<tt>std::pair&lt;<b>const</b> key, data&gt;</tt>;
+for example, the <tt>value_type</tt> of <tt>std::map&lt;<b>int</b>, <b>char</b>&gt;</tt> is
+<tt>std::pair&lt;<b>const int</b>, <b>char</b>&gt;</tt>. Futhermore, the <tt>value_type</tt> of a container and the <tt>value_type</tt> of the container's iterators are identical.
+</p>
+
+<p>
+ In <tt>pb_assoc</tt>, conversely, the rules are more complex.
+</p>
+
+<p> For one, a container's
+<tt>value_type</tt> is, in general
+<tt>std::pair&lt;<b>const</b> Key, Data&gt;</tt>,
+but if <tt>Data</tt> is <tt>null_data_type</tt>, then the <tt>value_type</tt>
+is
+<tt>Key</tt>,
+and if
+<tt>Data</tt> is
+<tt>compound_data_type&lt;Cntnr&gt;</tt>, then the <tt>value_type</tt> is
+<tt>std::pair&lt;<b>const</b> Key, Cntnr&gt;</tt>.
+</p>
+
+<p>
+ Futhermore, assume that <tt>Cntnr</tt> is an associative container with more than a single mapping level, and let <tt>Cntnr_</tt> be defined as
+</p>
+
+<pre>
+<b>typedef</b>
+ <b>typename</b> Cntnr::<b>template</b> rebind&lt;i&gt;::other</tt>
+ Cntnr_;
+</pre>
+<p>
+<i>i.e.</i>, the container rebound to a different mapping level.
+In this case, the <tt>value_type</tt> of the rebound container is not the <tt>value_type</tt>
+of the rebound container's iterators. <i>I.e.</i>, it is <emph>not</emph> true that
+<tt><b>typename</b> Cntnr_::value_type</tt> is the same as
+<tt><b>typename</b> Cntnr_::iterator::value_type</tt>. This complication never exists for the STL's container.
+</p>
+
+<h6 align = "center">
+<a name = "reference_iterator">
+<img src = "reference_iterator.jpg" width = "70%" alt = "no image">
+</h6>
+</a>
+<h6 align = "center">
+Iterator of a rebound type.
+</h6>
+
+
+<h3>Multisets</h3>
+
+<p>
+ <tt>pb_assoc</tt> does not contain a &quot;multiset&quot; type. The closest equivalent is mapping keys to non-negative integral types, <i>e.g.</i>, <tt>size_t</tt>.
+</p>
+
+</body>
+
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/ms_tag_cd.jpg b/libstdc++-v3/docs/html/ext/pb_assoc/ms_tag_cd.jpg
new file mode 100644
index 0000000..b114d93
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/ms_tag_cd.jpg
Binary files differ
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/ms_traits.html b/libstdc++-v3/docs/html/ext/pb_assoc/ms_traits.html
new file mode 100644
index 0000000..9336993
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/ms_traits.html
@@ -0,0 +1,131 @@
+
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+
+
+<html>
+<head>
+<title>ms_traits Interface
+</title>
+
+</head>
+
+<body>
+<h1>
+<tt>ms_traits
+</tt>
+
+ Interface
+
+
+</h1>
+
+<p>Traits of a container based on its mapping semantics.
+</p>
+
+<ol>
+<li>
+<a href = "../../../../include/ext/pb_assoc/ms_trait.hpp"><tt>ms_trait.hpp</tt>
+</a>
+
+</li>
+
+<li>
+Public Types and Constants:
+
+
+<ol>
+<li>
+<a href = "#link1">Container attribues.
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+</ol>
+
+
+<h2>
+<a name = "link1">Container attribues.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "30%" ALIGN = "left"><b>Type</b></TD><TD Width = "55%" ALIGN = "left"><b>Definition</b></TD><TD Width = "15%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "has_data3735929380">has_data</a></pre>
+
+
+</td>
+
+<td>
+<pre>True only if the container is not a &quot;set&quot type.</pre>
+
+
+</td>
+
+<td>
+<p>Data indicator.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "has_compound_data3735929399">has_compound_data</a></pre>
+
+
+</td>
+
+<td>
+<pre>True only if the container is not a &quot;set&quot type or &quot;map&quot; type.</pre>
+
+
+</td>
+
+<td>
+<p>Compound-data indicator.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "mapping_level3735929938">mapping_level</a></pre>
+
+
+</td>
+
+<td>
+<pre>The number of mapping-levels the container supports (1 for &quot;set&quot types or &quot;map&quot; types).</pre>
+
+
+</td>
+
+<td>
+<p>Mapping-level indicator.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+
+
+</body>
+
+</html>
+
+
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/node_invariant_invalidations.jpg b/libstdc++-v3/docs/html/ext/pb_assoc/node_invariant_invalidations.jpg
new file mode 100644
index 0000000..ea03b42
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/node_invariant_invalidations.jpg
Binary files differ
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/node_invariants.html b/libstdc++-v3/docs/html/ext/pb_assoc/node_invariants.html
new file mode 100644
index 0000000..9d23841
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/node_invariants.html
@@ -0,0 +1,154 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+<html>
+ <head>
+ <title>Node Invariants</title>
+ <meta name="GENERATOR" content="Microsoft Visual Studio .NET 7.1">
+ <meta name="vs_targetSchema" content="http://schemas.microsoft.com/intellisense/ie5">
+ </head>
+<body bgcolor = "white">
+<h1>Node Invariants</h1>
+
+<p>
+ Figure
+<a href = "#node_invariants">Some node invariants</a>
+shows some node invariants. A shows
+a tree whose each node contains, asides from an <tt>double</tt> key, the number
+of nodes at the subtree rooted at the node; B shows a tree whose each node
+contains, asides from a line-interval key, the maximal endpoint of the interval
+of any node in the subtree rooted at the node.
+ The first tree allows querying efficiently what is the order statistic
+of any element; the second tree allows querying efficiently if any, or which,
+intervals overlap a given interval.
+</p>
+
+<h6 align = "center">
+<a name = "node_invariants">
+<img src = "node_invariants.jpg" width = "50%" alt = "no image">
+</a>
+</h6>
+<h6 align = "center">
+Some node invariants.
+</h6>
+
+
+<p>
+ Maintaining such trees is difficult, for two reasons:
+</p>
+<ol>
+ <li> Various operations can invalidate node invariants.
+<i>E.g.</i>, Figure
+<a href = "#node_invariant_invalidations">Invalidation of node invariants</a>
+shows how a right rotation, performed on A, results in B, with nodes <i>x</i>
+and <i>y</i> having corrupted invariants (the greyed nodes in C);
+Figure
+<a href = "#node_invariant_invalidations">Invalidation of node invariants</a>
+shows how an insert, performed on D, results in E, with nodes <i>x</i>
+and <i>y</i> having corrupted invariants (the greyed nodes in F).
+ It is not feasible to know outside the tree the effect of an operation on the
+nodes of the tree.
+ </li>
+ <li>
+ Even if node invariants are maintained, it is not possible to know
+in advance which search paths are required (<i>e.g.</i>, searching for all
+line intervals overlapping some interval might require several search paths).
+ </li>
+</ol>
+
+
+<h6 align = "center">
+<a name = "node_invariant_invalidations">
+<img src = "node_invariant_invalidations.jpg" width = "80%" alt = "no image">
+</a>
+</h6>
+<h6 align = "center">
+Invalidation of node invariants.
+</h6>
+
+<p>
+ These problems are solved by a combination of two means:
+</p>
+
+<ol>
+ <li>
+ The tree-based containers are parameterized by a <tt>Node_Updator</tt>
+parameter. When a tree operation might invalidate some node invariant,
+a <tt>Node_Updator</tt> object is invoked to restore the invariant. This object is
+always invoked with three nodes: some node, say <i>x</i> in
+Figure
+<a href = "#restoring_node_invariants">Invalidation of node invariants</a>-A
+has an invalid invariant, but its children, <i>y</i> and <i>z</i> hav valid invariants.
+After the invocation, all three nodes have valid invariants, as
+in
+Figure
+<a href = "#restoring_node_invariants">Invalidation of node invariants</a>-B.
+It is well known that any <tt>insert</tt>, <tt>erase</tt>,
+<tt>split</tt> or <tt>join</tt>, can restore
+all node invariants by a small number of node invariant updates
+[<a href = "references.html#clrs2001">clrs2001</a>].
+For example, Figure
+<a href = "#update_seq_diagram">
+Insert update sequence diagram
+</a>
+shows an <tt>insert</tt> operation (point A); the tree performs some operations, and
+calls the update functor three times (points B, C, and D).
+ </li>
+ <li>
+ The tree based containers all define internally <tt>node_iterator</tt>
+ and <tt>const_node_iterator</tt>, iterators which can be used to traverse
+ from a node to any of its children or parent.
+ </li>
+</ol>
+
+<h6 align = "center">
+<a name = "restoring_node_invariants">
+<img src = "restoring_node_invariants.jpg" width = "80%" alt = "no image">
+</a>
+</h6>
+<h6 align = "center">
+Invalidation of node invariants.
+</h6>
+
+<h6 align = "center">
+<a name = "update_seq_diagram">
+<img src = "update_seq_diagram.jpg" width = "50%" alt = "no image">
+</a>
+</h6>
+<h6 align = "center">
+Insert update sequence diagram.
+</h6>
+
+
+<p>
+ In
+<a href = "concepts.html#concepts_null_policies">Null Policy Classes</a>
+a distinction was made between <i>redundant policies</i>
+and <i>null policies</i>.
+</p>
+
+<p>
+ Seemingly, in this case a redundant policy - a policy which doesn't
+affect nodes' contents would suffice in this case. This, however, would
+lead to performance loss.
+Figure
+<a href = "#rationale_null_node_updator">
+Rationale for null node-invariant functors
+</a>
+shows a typical case where invariants are restored (in this case, to the
+shaded node). In most cases, tree operations such as rotations affect only
+the lower levels of the tree. A null policy allows to know that there
+is no need to traverse the tree to the root.
+</p>
+
+<h6 align = "center">
+<a name = "rationale_null_node_updator">
+<img src = "rationale_null_node_updator.jpg" width = "50%" alt = "no image">
+</a>
+</h6>
+<h6 align = "center">
+Rationale for null node-invariant functors.
+</h6>
+
+
+</body>
+
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/node_invariants.jpg b/libstdc++-v3/docs/html/ext/pb_assoc/node_invariants.jpg
new file mode 100644
index 0000000..d9b96dd
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/node_invariants.jpg
Binary files differ
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/non_unique_mapping.html b/libstdc++-v3/docs/html/ext/pb_assoc/non_unique_mapping.html
new file mode 100644
index 0000000..866ea52
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/non_unique_mapping.html
@@ -0,0 +1,404 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+<html>
+<head>
+ <title>Non-Unique Mapping Containers</title>
+ <meta name="GENERATOR" content="Microsoft Visual Studio .NET 7.1">
+ <meta name="vs_targetSchema" content="http://schemas.microsoft.com/intellisense/ie5">
+</head>
+<body bgcolor="white">
+
+<h1>Non-Unique Mapping Containers</h1>
+
+<p>
+ This section describes the design of non-unique mapping containers
+(multimaps and multisets). It is organized as follows:
+</p>
+<ol>
+ <li> The <a href = "#general">Main Points</a> Section describes the main points.
+ </li>
+ <li>
+ The <a href = "#types">Mapped Data Types and Mapped Value Types</a> Section
+ describes some additional types that each associative container defines.
+ </li>
+ <li> The <a href = "generics">Generics</a> Section describes some classes for
+ generic programming.
+ </li>
+ <li> The <a href = "#compound_keys">Compound Keys</a> Section describes an
+ alternative to the STL's design of using equivalent, non-identical, keys.
+ </li>
+</ol>
+
+<h2><a name = "general">Main Points</a></h2>
+
+<p>
+ In <tt>pb_assoc</tt>, all associative containers have a unique-key design;
+each container can have at most one entry for any given key. Multimaps
+are designed as maps from keys to sets; multisets are designed as maps from
+keys to non-negative integral types.
+</p>
+
+
+
+<h2><a name = "types">Mapped Data Types and Mapped Value Types</a></h2>
+
+<p>
+ The STL's design of associative containers elegantly allows
+generic manipulation of containers: each container defines
+<tt>data_type</tt> as the domain of its data;
+<tt>value_type</tt> as the domain of its relationship. This is not
+directly applicable in <tt>pb_assoc</tt>. Consider
+a multimap mapping <tt>Key</tt> objects to
+<tt>Data_Coll</tt> objects, where
+<tt>Data_Coll</tt> is some set-type of <tt>Data</tt>.
+Then should the multimap's <tt>value_type</tt> should be
+<tt>std::pair&lt;Key, Data&gt;</tt> or
+<tt>std::pair&lt;Key, Data_Coll&gt;</tt>, for example?.
+</p>
+
+<p>
+ <tt>pb_assoc</tt> addresses this by differentiating
+between the <i>domain</i> and the <i>type</i> of relationship.
+All associative containers define <tt>value_type</tt> as
+the relationship's <i>domain</i>, and <tt>mapped_value_type</tt> as its
+<i>type</i>. <i>E.g.</i>, both
+map types and multimap types may share the same <tt>value_type</tt>,
+if they map from the same key domain to
+the same data domain. In this case, however, they will not share
+the same <tt>mapped_value_type</tt>, since the multimap type maps from the
+key domain to the domain of collections of data. The same
+differentiation exists between the domain and type of mapped data.
+</p>
+
+<p>
+ In general, the following types describe the relationships
+of each associative container:
+</p>
+<ol>
+ <li>
+ <tt>key_type</tt>- This describes the domain of the keys of the container. All
+ associative containers define this type.
+ </li>
+ <li>
+ <tt>data_type</tt>- This describes the <i>domain</i> of the data mapped by a
+ key. It is identical to the <tt>data_type</tt> defined by <tt>std::map</tt>, <tt>std::set</tt>,
+ <tt>std::multimap</tt>, and <tt>std::multiset</tt>. Sets and multisets do not
+ define this type, since they map each key to the abstract fact that the key is
+ stored by them.
+ </li>
+ <li>
+ <tt>mapped_data_type</tt>- This describes the <i>type</i> of the data mapped by
+ a key. For maps, this is the same as <tt>data_type</tt>. For multimaps, this is
+ not the same as <tt>data_type</tt>; The <tt>mapped_data_type</tt> describes the
+ collection of <tt>data_type</tt>s used. Sets do not define this type. For
+ multisets, the <tt>mapped_data_type</tt> describes the unsigned integral type
+ used to indicate the number of occurrences of a key.
+ </li>
+ <li>
+ <tt>value_type</tt>- This describes the <i>domain</i> of relationships store in
+ a container. It is identical to the <tt>value_type</tt> defined by <tt>std::map</tt>,
+ <tt>std::set</tt>, <tt>std::multimap</tt>, and <tt>std::multiset</tt>.
+ </li>
+ <li>
+ <tt>mapped_value_type</tt>- This describes the <i>type</i> of relationships
+ store in a container. It consists of information on the <tt>key_type</tt> and <tt>mapped_data_type</tt>
+ (except for sets).
+ </li>
+</ol>
+
+<p>
+ The following table defines the above types for a map
+mapping from <tt>Key</tt> types to <tt>Data</tt> types:
+</p>
+<TABLE WIDTH="100%" BORDER="1" ID="Table1">
+ <TR>
+ <TD Width="50%" ALIGN="left"><b>type</b></TD>
+ <TD Width="50%" ALIGN="left"><b>Description / Definition</b></TD>
+ </TR>
+ <TR>
+ <TD ALIGN="left"><pre>key_type</pre>
+ </TD>
+ <TD ALIGN="left"><pre>Key</pre>
+ </TD>
+ </TR>
+ <TR>
+ <TD ALIGN="left"><pre>data_type</pre>
+ </TD>
+ <TD ALIGN="left"><pre>Data</pre>
+ </TD>
+ </TR>
+ <TR>
+ <TD ALIGN="left"><pre>mapped_data_type</pre>
+ </TD>
+ <TD ALIGN="left"><pre>Data</pre>
+ </TD>
+ </TR>
+ <TR>
+ <TD ALIGN="left"><pre>value_type</pre>
+ </TD>
+ <TD ALIGN="left"><pre>std::pair&lt;<b>const</b> Key, Data&gt;</pre>
+ </TD>
+ </TR>
+ <TR>
+ <TD ALIGN="left"><pre>mapped_value_type</pre>
+ </TD>
+ <TD ALIGN="left"><pre>std::pair&lt;<b>const</b> Key, Data&gt;</pre>
+ </TD>
+ </TR>
+</TABLE>
+
+
+<p>The following table defines the above types for a
+set storing <tt>Key</tt> types:</p>
+<TABLE WIDTH="100%" BORDER="1" ID="Table2">
+ <TR>
+ <TD Width="50%" ALIGN="left"><b>type</b></TD>
+ <TD Width="50%" ALIGN="left"><b>Description / Definition</b></TD>
+ </TR>
+ <TR>
+ <TD ALIGN="left"><pre>key_type</pre>
+ </TD>
+ <TD ALIGN="left"><pre>Key</pre>
+ </TD>
+ </TR>
+ <TR>
+ <TD ALIGN="left"><pre>data_type</pre>
+ </TD>
+ <TD ALIGN="left">-</TD>
+ </TR>
+ <TR>
+ <TD ALIGN="left"><pre>mapped_data_type</pre>
+ </TD>
+ <TD ALIGN="left">-</TD>
+ </TR>
+ <TR>
+ <TD ALIGN="left"><pre>value_type</pre>
+ </TD>
+ <TD ALIGN="left"><pre><b>const</b> Key</pre>
+ </TD>
+ </TR>
+ <TR>
+ <TD ALIGN="left"><pre>mapped_value_type</pre>
+ </TD>
+ <TD ALIGN="left"><pre><b>const</b> Key</pre>
+ </TD>
+ </TR>
+</TABLE>
+
+<p>The following table defines the above types for a multimap
+mapping from <tt>Key</tt> types to <tt>Data_Coll&lt;Data&gt;</tt>
+types, where <tt>Data_Coll&lt;Data&gt;</tt>
+is a set of <tt>Data</tt> types:</p>
+<TABLE WIDTH="100%" BORDER="1" ID="Table3">
+ <TR>
+ <TD Width="50%" ALIGN="left"><b>type</b></TD>
+ <TD Width="50%" ALIGN="left"><b>Description / Definition</b></TD>
+ </TR>
+ <TR>
+ <TD ALIGN="left"><pre>key_type</pre>
+ </TD>
+ <TD ALIGN="left"><pre>Key</pre>
+ </TD>
+ </TR>
+ <TR>
+ <TD ALIGN="left"><pre>data_type</pre>
+ </TD>
+ <TD ALIGN="left"><pre>Data</pre>
+ </TD>
+ </TR>
+ <TR>
+ <TD ALIGN="left"><pre>mapped_data_type</pre>
+ </TD>
+ <TD ALIGN="left"><pre>Data_Coll&lt;Data&gt;</pre>
+ </TD>
+ </TR>
+ <TR>
+ <TD ALIGN="left"><pre>value_type</pre>
+ </TD>
+ <TD ALIGN="left"><pre>std::pair&lt;<b>const</b> Key, Data&gt;</pre>
+ </TD>
+ </TR>
+ <TR>
+ <TD ALIGN="left"><pre>mapped_value_type</pre>
+ </TD>
+ <TD ALIGN="left"><pre>std::pair&lt;<b>const</b> Key, Data_Coll&lt;Data&gt; &gt;</pre>
+ </TD>
+ </TR>
+</TABLE>
+
+<p>The following table defines the above types for a multiset
+storing <tt>Key</tt> types:</p>
+<TABLE WIDTH="100%" BORDER="1" ID="Table4">
+ <TR>
+ <TD Width="50%" ALIGN="left"><b>type</b></TD>
+ <TD Width="50%" ALIGN="left"><b>Description / Definition</b></TD>
+ </TR>
+ <TR>
+ <TD ALIGN="left"><pre>key_type</pre>
+ </TD>
+ <TD ALIGN="left"><pre>Key</pre>
+ </TD>
+ </TR>
+ <TR>
+ <TD ALIGN="left"><pre>data_type</pre>
+ </TD>
+ <TD ALIGN="left">-</TD>
+ </TR>
+ <TR>
+ <TD ALIGN="left"><pre>mapped_data_type</pre>
+ </TD>
+ <TD ALIGN="left"><pre>size_type</pre>
+ </TD>
+ </TR>
+ <TR>
+ <TD ALIGN="left"><pre>value_type</pre>
+ </TD>
+ <TD ALIGN="left"><pre>std::pair&lt;<b>const</b> Key, size_type&gt;</pre>
+ </TD>
+ </TR>
+ <TR>
+ <TD ALIGN="left"><pre>mapped_value_type</pre>
+ </TD>
+ <TD ALIGN="left"><pre><b>const</b> Key</pre>
+ </TD>
+ </TR>
+</TABLE>
+
+<p>
+ The above types allow to define simple invariants on the interfaces of
+containers. For example, each container defines both an <tt>insert</tt> method
+which takes a const reference to a <tt>value_type</tt>, and an <tt>insert</tt> method
+which takes a const reference to a <tt>mapped_value_type</tt>. Containers for
+which both these types are synonymous (<i>i.e.</i>, maps and sets), consequently
+have a
+single <tt>insert</tt> method. Containers for which these types are distinct (<i>i.e.</i>,
+multimaps and multisets), use overloading.
+</p>
+
+
+
+
+
+<h2><a name="generics">Generics</a></h2>
+<p>
+ <tt>pb_assoc</tt> contains a number of utility classes to ease generic
+programming.
+</p>
+
+<p>
+ There are four container-type identifiers, <a href="is_map_type.html"><tt>is_map_type</tt></a>,
+<a href="is_set_type.html"><tt>is_set_type</tt></a>, <a href="is_multimap_type.html">
+ <tt>is_multimap_type</tt></a>, and <a href="is_multiset_type.html"><tt>is_multiset_type</tt></a>.
+Given a container <tt>T</tt>, for example, it is possible to query at compile
+time whether it is a a multimap type by writing <tt>is_multimap_type&lt;T&gt;::value</tt>.
+(This is probably very similar to [<a href="references.html#boost_concept_check">boost_concept_check</a>]
+and [<a href="references.html#boost_type_traits">boost_type_traits</a>].)
+</p>
+
+<p>
+ In some cases, it is necessary, given a container and an iterator, to query the
+iterator' <tt>value_type</tt> to the container's <tt>value_type</tt> and <tt>mapped_value_type</tt>.
+The classes
+<a href="is_mapped_value_iterator.html"><tt>is_mapped_value_iterator</tt></a>
+and <a href="iterator_key.html"><tt>iterator_key</tt></a> can be used for this.
+</p>
+
+<p>
+ The STL's <tt>std::multimap</tt> and <tt>std::multiset</tt> allow iterating
+over all <tt>value_type</tt>s stored in them, which is convenient. The library
+provides a <a href="value_iterators.html"><tt>value_iterator</tt></a> for this.
+This is an iterator adapter over the containers' native iterators.
+</p>
+
+
+
+
+<h2><a name = "compound_keys">Compound Keys</a></h2>
+
+<p>
+ The STL allows using equivalent, non-identical, keys.
+For example, let <tt>interval</tt> be a line-interval class,
+<tt>color</tt> be a
+color type, <tt>thickness</tt> be a thickness type, and <tt>colored_interval</tt>
+be a class composed of an <tt>interval</tt> and a <tt>color</tt>.
+</p>
+
+<p>
+ Suppose one wants to store <tt>colored_interval</tt>
+objects using a comparison predicate ignoring colors. Then
+in the STL's design, one would use
+<tt>multiset&lt;colored_interval&gt;</tt>; in <tt>pb_assoc</tt>'s design,
+one would use one of the following:
+</p>
+<ol>
+ <li>
+ A map mapping <tt>interval</tt> objects to
+<tt>color</tt> objects. This, however, assumes that
+<tt>colored_interval</tt> is decomposable to, and constructible from,
+<tt>interval</tt> and <tt>color</tt>.
+ </li>
+ <li>
+ A map mapping <tt>colored_interval</tt> objects to
+<tt>color</tt> objects. In this (less efficient) case, a <tt>colored_interval</tt> object
+is a "representative" of all colored intervals with the same endpoints.
+ </li>
+</ol>
+
+<p>
+ Suppose one wants to map <tt>colored_interval</tt>
+objects to <tt>thickness</tt> objects
+using a comparison predicate ignoring colors. Then
+in the STL's design, one would use
+<tt>multimap&lt;colored_interval, thickness&gt;</tt>; in <tt>pb_assoc</tt>'s design,
+one would use one of the following:
+</p>
+<ol>
+ <li> A map mapping <tt>interval</tt> objects to
+<tt>std::pair&lt;color, thickness&gt;</tt> objects. This, however, assumes that
+<tt>colored_interval</tt> is decomposable to, and constructible from,
+<tt>interval</tt> and <tt>color</tt>.
+ </li>
+ <li> A map mapping <tt>colored_interval</tt> objects to
+<tt>std::pair&lt;color, thickness&gt;</tt> objects. In this (less efficient) case, a <tt>colored_interval</tt> object
+is a "representative" of all colored intervals with the same endpoints.
+ </li>
+</ol>
+
+<p>
+(From the above, it is apparent that the STL's design has an advantage
+over <tt>pb_assoc</tt>'s design in terms of convenience. Nonethless, there
+are efficiency limitation in the STL's design (see
+<a href = "motivation.html#unique_key">Unique-Key Design for Multimaps and Multisets</a>).)
+</p>
+
+<p>
+ The above example, using intervals, colors and thicknesses, can be generalized.
+Let
+<tt>key_unique_part</tt> be a unique part of some key
+(<i>e.g.</i>, <tt>interval</tt> in the above),
+<tt>key_non_unique_part</tt> be a non-unique part of some key
+(<i>e.g.</i>, <tt>color</tt> in the above),
+<tt>key</tt> be some key composed of unique and non-uniqe parts
+(<i>e.g.</i>, <tt>colored_interval</tt> in the above),
+and
+<tt>data</tt> be some data
+(<i>e.g.</i>, <tt>thickness</tt> in the above).
+Then the <a href = "#stl_to_pb_assoc_non_unique_mapping">
+figure shows some
+STL containers and the <tt>pb_assoc</tt> counterparts.
+</a>
+
+</p>
+
+
+<h6 align = "center">
+<a name = "stl_to_pb_assoc_non_unique_mapping">
+<img src = "stl_to_pb_assoc_non_unique_mapping.jpg" alt = "no-image" width = "60%">
+</a>
+</h6>
+<h6 align = "center">
+STL containers and <tt>pb_assoc</tt> counterparts.
+</h6>
+
+
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/non_unique_mapping_containers.jpg b/libstdc++-v3/docs/html/ext/pb_assoc/non_unique_mapping_containers.jpg
new file mode 100644
index 0000000..3bdacd0
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/non_unique_mapping_containers.jpg
Binary files differ
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/null_data_type.html b/libstdc++-v3/docs/html/ext/pb_assoc/null_data_type.html
new file mode 100644
index 0000000..b5d0120
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/null_data_type.html
@@ -0,0 +1,41 @@
+
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+
+
+<html>
+<head>
+<title>null_data_type Interface
+</title>
+
+</head>
+
+<body>
+<h1>
+<tt>null_data_type
+</tt>
+
+ Interface
+
+
+</h1>
+
+<p>A data-policy indicating that an associative container is a &quot;set&quot;
+</p>
+
+<ol>
+<li>
+<a href = "../../../../include/ext/pb_assoc/data_type.hpp"><tt>data_type.hpp</tt>
+</a>
+
+</li>
+
+</ol>
+
+
+
+
+</body>
+
+</html>
+
+
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/null_hash_fn.html b/libstdc++-v3/docs/html/ext/pb_assoc/null_hash_fn.html
new file mode 100644
index 0000000..083de7e
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/null_hash_fn.html
@@ -0,0 +1,44 @@
+
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+
+
+<html>
+<head>
+<title>null_hash_fn Interface
+</title>
+
+</head>
+
+<body>
+<h1>
+<tt>null_hash_fn
+</tt>
+
+ Interface
+
+
+</h1>
+
+<p>A &quot;null&quot; hash function, indicating that the combining hash function is actually a ranged-hash function.
+</p>
+
+<p><a href = "concepts.html#concepts_null_policies">Null Policy Classes</a> explains the concept ofa null policy.
+</p>
+
+<ol>
+<li>
+<a href = "../../../../include/ext/pb_assoc/hash_policy.hpp"><tt>hash_policy.hpp</tt>
+</a>
+
+</li>
+
+</ol>
+
+
+
+
+</body>
+
+</html>
+
+
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/null_probe_fn.html b/libstdc++-v3/docs/html/ext/pb_assoc/null_probe_fn.html
new file mode 100644
index 0000000..1088b6b
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/null_probe_fn.html
@@ -0,0 +1,44 @@
+
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+
+
+<html>
+<head>
+<title>null_probe_fn Interface
+</title>
+
+</head>
+
+<body>
+<h1>
+<tt>null_probe_fn
+</tt>
+
+ Interface
+
+
+</h1>
+
+<p>A &quot;null&quot; probe function, indicating that the combining probe function is actually a ranged probe function.
+</p>
+
+<p><a href = "concepts.html#concepts_null_policies">Null Policy Classes</a> explains the concept ofa null policy.
+</p>
+
+<ol>
+<li>
+<a href = "../../../../include/ext/pb_assoc/hash_policy.hpp"><tt>hash_policy.hpp</tt>
+</a>
+
+</li>
+
+</ol>
+
+
+
+
+</body>
+
+</html>
+
+
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/order_by_key.html b/libstdc++-v3/docs/html/ext/pb_assoc/order_by_key.html
new file mode 100644
index 0000000..0b37f53
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/order_by_key.html
@@ -0,0 +1,254 @@
+
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+
+
+<html>
+<head>
+<title>order_by_key Interface
+</title>
+
+</head>
+
+<body>
+<h1>
+<tt>order_by_key
+</tt>
+
+ Interface
+
+
+</h1>
+
+<p>Finds an order corresponding to an entry within the sequence.
+</p>
+
+<ol>
+<li>
+<a href = "../../../../include/ext/pb_assoc/order_statistics_key.hpp"><tt>order_statistics_key.hpp</tt>
+</a>
+
+</li>
+
+<li>
+<a href = "#link1">Template parameters.
+</a>
+
+</li>
+
+<li>
+Public Types and Constants:
+
+
+<ol>
+<li>
+<a href = "#link2">Key-type definitions.
+</a>
+
+</li>
+
+<li>
+<a href = "#link3">Container definitions.
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+<li>
+Public Methods:
+
+
+<ol>
+<li>
+<a href = "#link4">Operators.
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+</ol>
+
+
+<h2>
+<a name = "link1">Template parameters.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "20%" ALIGN = "left"><b>Parameter</b></TD><TD Width = "50%" ALIGN = "left"><b>Description</b></TD><TD Width = "30%" ALIGN = "left"><b>Default Value</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "Cntnr3735929076">Cntnr</a></pre>
+
+
+</td>
+
+<td>
+<p>Container type.</p>
+
+
+</td>
+
+<td>
+-
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link2">Key-type definitions.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "30%" ALIGN = "left"><b>Type</b></TD><TD Width = "55%" ALIGN = "left"><b>Definition</b></TD><TD Width = "15%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "order_statistics_key_type3735929828">order_statistics_key_type</a></pre>
+
+
+</td>
+
+<td>
+<pre><b>typename</b> <a href = "#Cntnr3735929076">Cntnr</a>::key_type</pre>
+
+
+</td>
+
+<td>
+<p>Order-statistics key type.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "underlying_key_type3735929533">underlying_key_type</a></pre>
+
+
+</td>
+
+<td>
+<pre><b>typename</b> <a href = "#order_statistics_key_type3735929828">order_statistics_key_type</a>::key_type</pre>
+
+
+</td>
+
+<td>
+<p>Underlying key type.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link3">Container definitions.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "30%" ALIGN = "left"><b>Type</b></TD><TD Width = "55%" ALIGN = "left"><b>Definition</b></TD><TD Width = "15%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "cntnr3735929108">cntnr</a></pre>
+
+
+</td>
+
+<td>
+<pre><a href = "#Cntnr3735929076">Cntnr</a></pre>
+
+
+</td>
+
+<td>
+<p>Container type.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "size_type3735929547">size_type</a></pre>
+
+
+</td>
+
+<td>
+<pre><b>typename</b> <a href = "#cntnr3735929108">cntnr</a>::size_type</pre>
+
+
+</td>
+
+<td>
+<p>Container's size type.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link4">Operators.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>inline</b> <a href = "#size_type3735929547">size_type</a>
+ <b>operator</b>()
+ (<b>const</b> <a href = "#Cntnr3735929076">Cntnr</a> &amp;r_c,
+ <b>const</b> <a href = "#underlying_key_type3735929533">underlying_key_type</a> &amp;r_key) <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Returns the order of a key within a sequence. For exapmle, if <font color = "#666666"><tt>r_key</tt></font> is the smallest key in <font color = "#666666"><tt>r_c</tt></font>, this method will return 0; if <font color = "#666666"><tt>r_key</tt></font> is a key between the smallest and next key in <font color = "#666666"><tt>r_c</tt></font>, this method will return 1; if <font color = "#666666"><tt>r_key</tt></font> is a key larger than the largest key in <font color = "#666666"><tt>r_c</tt></font>, this method will return the size of <font color = "#666666"><tt>r_c</tt></font>.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+
+
+</body>
+
+</html>
+
+
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/order_statistics_key.html b/libstdc++-v3/docs/html/ext/pb_assoc/order_statistics_key.html
new file mode 100644
index 0000000..7417910
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/order_statistics_key.html
@@ -0,0 +1,373 @@
+
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+
+
+<html>
+<head>
+<title>order_statistics_key Interface
+</title>
+
+</head>
+
+<body>
+<h1>
+<tt>order_statistics_key
+</tt>
+
+ Interface
+
+
+</h1>
+
+<p>A &quot;key&quot; type using rank metadata for order statistics.
+</p>
+
+<p>The class is composed of the logical key and the rank of the element (the number of elements in its subtree).
+</p>
+
+<ol>
+<li>
+<a href = "../../../../include/ext/pb_assoc/order_statistics_key.hpp"><tt>order_statistics_key.hpp</tt>
+</a>
+
+</li>
+
+<li>
+<a href = "#link1">Template parameters.
+</a>
+
+</li>
+
+<li>
+Public Types and Constants:
+
+
+<ol>
+<li>
+<a href = "#link2">Policy definitions.
+</a>
+
+</li>
+
+<li>
+<a href = "#link3">Key-type definitions.
+</a>
+
+</li>
+
+<li>
+<a href = "#link4">Misc.
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+<li>
+Public Methods:
+
+
+<ol>
+<li>
+<a href = "#link5">Constructors, destructor, and related.
+</a>
+
+</li>
+
+<li>
+<a href = "#link6">Conversions.
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+</ol>
+
+
+<h2>
+<a name = "link1">Template parameters.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "20%" ALIGN = "left"><b>Parameter</b></TD><TD Width = "50%" ALIGN = "left"><b>Description</b></TD><TD Width = "30%" ALIGN = "left"><b>Default Value</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "Key3735928856">Key</a></pre>
+
+
+</td>
+
+<td>
+<p>Key type.</p>
+
+
+</td>
+
+<td>
+-
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "Allocator3735929488">Allocator</a></pre>
+
+
+</td>
+
+<td>
+<p>Allocator type.</p>
+
+
+<p>The allocator is only used for definitions, e.g., size_type, pointer, and reference.</p>
+
+
+</td>
+
+<td>
+<pre>std::allocator&lt;<b>char</b>&gt;</pre>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link2">Policy definitions.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "30%" ALIGN = "left"><b>Type</b></TD><TD Width = "55%" ALIGN = "left"><b>Definition</b></TD><TD Width = "15%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "allocator3735929520">allocator</a></pre>
+
+
+</td>
+
+<td>
+<pre><a href = "#Allocator3735929488">Allocator</a></pre>
+
+
+</td>
+
+<td>
+<p>Allocator type.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link3">Key-type definitions.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "30%" ALIGN = "left"><b>Type</b></TD><TD Width = "55%" ALIGN = "left"><b>Definition</b></TD><TD Width = "15%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "key_type3735929433">key_type</a></pre>
+
+
+</td>
+
+<td>
+<pre><a href = "#Key3735928856">Key</a></pre>
+
+
+</td>
+
+<td>
+<p>Key type.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "const_key_reference3735929552">const_key_reference</a></pre>
+
+
+</td>
+
+<td>
+<pre><b>typename</b> <a href = "#Allocator3735929488">Allocator</a>::<b>template</b> rebind&lt;
+ <a href = "#Key3735928856">Key</a> &gt;::other::const_reference</pre>
+
+
+</td>
+
+<td>
+<p>Const key reference type.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "key_reference3735929926">key_reference</a></pre>
+
+
+</td>
+
+<td>
+<pre><b>typename</b> <a href = "#Allocator3735929488">Allocator</a>::<b>template</b> rebind&lt;
+ <a href = "#Key3735928856">Key</a> &gt;::other::reference</pre>
+
+
+</td>
+
+<td>
+<p>Key reference type.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link4">Misc.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "30%" ALIGN = "left"><b>Type</b></TD><TD Width = "55%" ALIGN = "left"><b>Definition</b></TD><TD Width = "15%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "size_type3735929547">size_type</a></pre>
+
+
+</td>
+
+<td>
+<pre><b>typename</b> <a href = "#allocator3735929520">allocator</a>::size_type</pre>
+
+
+</td>
+
+<td>
+<p>Size type.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link5">Constructors, destructor, and related.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>inline</b> <b>explicit</b>
+ order_statistics_key
+ (<a href = "#const_key_reference3735929552">const_key_reference</a> r_key = <a href = "#Key3735928856">Key</a>())</pre>
+
+
+</td>
+
+<td>
+<p>Constructor which takes a logical key.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link6">Conversions.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>inline</b>
+ <b>operator</b> <a href = "#key_reference3735929926">key_reference</a>
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Conversion to logical key.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre> <b>inline</b>
+ <b>operator</b> <a href = "#key_type3735929433">key_type</a>
+ () <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Conversion to logical key.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+
+
+</body>
+
+</html>
+
+
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/order_statistics_key_cmp.html b/libstdc++-v3/docs/html/ext/pb_assoc/order_statistics_key_cmp.html
new file mode 100644
index 0000000..d85f4fa
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/order_statistics_key_cmp.html
@@ -0,0 +1,422 @@
+
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+
+
+<html>
+<head>
+<title>order_statistics_key_cmp Interface
+</title>
+
+</head>
+
+<body>
+<h1>
+<tt>order_statistics_key_cmp
+</tt>
+
+ Interface
+
+
+</h1>
+
+<p>A comparison functor. Transforms any comparison functor operating on logical keys to a comparison functor operating on order statistics keys.
+</p>
+
+<ol>
+<li>
+<a href = "../../../../include/ext/pb_assoc/order_statistics_key.hpp"><tt>order_statistics_key.hpp</tt>
+</a>
+
+</li>
+
+<li>
+<a href = "#link1">Template parameters.
+</a>
+
+</li>
+
+<li>
+<a href = "#link2">Base classes.
+</a>
+
+</li>
+
+<li>
+Public Types and Constants:
+
+
+<ol>
+<li>
+<a href = "#link3">Policy definitions.
+</a>
+
+</li>
+
+<li>
+<a href = "#link4">Key-type definitions.
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+<li>
+Public Methods:
+
+
+<ol>
+<li>
+<a href = "#link5">Constructors, destructor, and related.
+</a>
+
+</li>
+
+<li>
+<a href = "#link6">Operators.
+</a>
+
+</li>
+
+<li>
+<a href = "#link7">Policy access methods.
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+</ol>
+
+
+<h2>
+<a name = "link1">Template parameters.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "20%" ALIGN = "left"><b>Parameter</b></TD><TD Width = "50%" ALIGN = "left"><b>Description</b></TD><TD Width = "30%" ALIGN = "left"><b>Default Value</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "Cmp_Fn3735929122">Cmp_Fn</a></pre>
+
+
+</td>
+
+<td>
+<p>Comparison functor.</p>
+
+
+</td>
+
+<td>
+<pre>std::less&lt;<a href = "#Key3735928856">Key</a>&gt;</pre>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "Allocator3735929488">Allocator</a></pre>
+
+
+</td>
+
+<td>
+<p>Allocator type.</p>
+
+
+<p>The allocator is only used for definitions, e.g., size_type, pointer, and reference.</p>
+
+
+</td>
+
+<td>
+<pre>std::allocator&lt;<b>char</b>&gt;</pre>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link2">Base classes.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "80%" ALIGN = "left"><b>Class</b></TD><TD Width = "20%" ALIGN = "left"><b>Derivation Type</b></TD></TR>
+
+
+<tr>
+<td>
+<pre>std::binary_function&lt;
+ order_statistics_key&lt;
+ <b>typename</b> <a href = "#Cmp_Fn3735929122">Cmp_Fn</a>::first_argument_type, <a href = "#Allocator3735929488">Allocator</a>&gt;,
+ order_statistics_key&lt;
+ <b>typename</b> <a href = "#Cmp_Fn3735929122">Cmp_Fn</a>::second_argument_type, <a href = "#Allocator3735929488">Allocator</a>&gt;,
+ <b>bool</b>&gt;</pre>
+
+
+</td>
+
+<td>
+<p>public</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link3">Policy definitions.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "30%" ALIGN = "left"><b>Type</b></TD><TD Width = "55%" ALIGN = "left"><b>Definition</b></TD><TD Width = "15%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "allocator3735929520">allocator</a></pre>
+
+
+</td>
+
+<td>
+<pre><a href = "#Allocator3735929488">Allocator</a></pre>
+
+
+</td>
+
+<td>
+<p>Allocator type.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "cmp_fn3735929186">cmp_fn</a></pre>
+
+
+</td>
+
+<td>
+<pre><a href = "#Cmp_Fn3735929122">Cmp_Fn</a></pre>
+
+
+</td>
+
+<td>
+<p>Comparison functor type.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link4">Key-type definitions.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "30%" ALIGN = "left"><b>Type</b></TD><TD Width = "55%" ALIGN = "left"><b>Definition</b></TD><TD Width = "15%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "key_type3735929433">key_type</a></pre>
+
+
+</td>
+
+<td>
+<pre>order_statistics_key&lt;
+ <b>typename</b> <a href = "#Cmp_Fn3735929122">Cmp_Fn</a>::first_argument_type, <a href = "#Allocator3735929488">Allocator</a>&gt;</pre>
+
+
+</td>
+
+<td>
+<p>Key type.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "const_key_reference3735929552">const_key_reference</a></pre>
+
+
+</td>
+
+<td>
+<pre><b>typename</b> <a href = "#allocator3735929520">allocator</a>::<b>template</b> rebind&lt;
+ <a href = "#key_type3735929433">key_type</a>&gt;::other::const_reference</pre>
+
+
+</td>
+
+<td>
+<p>Const key reference type.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link5">Constructors, destructor, and related.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>inline</b>
+ order_statistics_key_cmp
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Default constructor.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b>
+ order_statistics_key_cmp
+ (<b>const</b> <a href = "#Cmp_Fn3735929122">Cmp_Fn</a> &amp;r_cmp_fn)</pre>
+
+
+</td>
+
+<td>
+<p>Constructor taking a comparison functor.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link6">Operators.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>inline</b> <b>bool</b>
+ <b>operator</b>()
+ (<a href = "#const_key_reference3735929552">const_key_reference</a> r_lhs_key,
+ <a href = "#const_key_reference3735929552">const_key_reference</a> r_rhs_key) <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Compares two keys.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link7">Policy access methods.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>inline</b> <a href = "#cmp_fn3735929186">cmp_fn</a> &amp;
+ get_cmp_fn
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Access to the comparison functor object used.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <b>const</b> <a href = "#cmp_fn3735929186">cmp_fn</a> &amp;
+ get_cmp_fn
+ () <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Const access to the comparison functor object used.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+
+
+</body>
+
+</html>
+
+
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/order_statistics_node_updator.html b/libstdc++-v3/docs/html/ext/pb_assoc/order_statistics_node_updator.html
new file mode 100644
index 0000000..a9acbb4
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/order_statistics_node_updator.html
@@ -0,0 +1,278 @@
+
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+
+
+<html>
+<head>
+<title>order_statistics_node_updator Interface
+</title>
+
+</head>
+
+<body>
+<h1>
+<tt>order_statistics_node_updator
+</tt>
+
+ Interface
+
+
+</h1>
+
+<p>Functor updating ranks of entries.
+</p>
+
+<ol>
+<li>
+<a href = "../../../../include/ext/pb_assoc/order_statistics_key.hpp"><tt>order_statistics_key.hpp</tt>
+</a>
+
+</li>
+
+<li>
+<a href = "#link1">Template parameters.
+</a>
+
+</li>
+
+<li>
+Public Types and Constants:
+
+
+<ol>
+<li>
+<a href = "#link2">Policy definitions.
+</a>
+
+</li>
+
+<li>
+<a href = "#link3">Key-type definitions.
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+<li>
+Public Methods:
+
+
+<ol>
+<li>
+<a href = "#link4">Constructors, destructor, and related.
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+</ol>
+
+
+<h2>
+<a name = "link1">Template parameters.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "20%" ALIGN = "left"><b>Parameter</b></TD><TD Width = "50%" ALIGN = "left"><b>Description</b></TD><TD Width = "30%" ALIGN = "left"><b>Default Value</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "Key3735928856">Key</a></pre>
+
+
+</td>
+
+<td>
+<p>Key type.</p>
+
+
+</td>
+
+<td>
+-
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "Allocator3735929488">Allocator</a></pre>
+
+
+</td>
+
+<td>
+<p>Allocator type.</p>
+
+
+<p>The allocator is only used for definitions, e.g., size_type, pointer, and reference.</p>
+
+
+</td>
+
+<td>
+<pre>std::allocator&lt;<b>char</b>&gt;</pre>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link2">Policy definitions.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "30%" ALIGN = "left"><b>Type</b></TD><TD Width = "55%" ALIGN = "left"><b>Definition</b></TD><TD Width = "15%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "allocator3735929520">allocator</a></pre>
+
+
+</td>
+
+<td>
+<pre><a href = "#Allocator3735929488">Allocator</a></pre>
+
+
+</td>
+
+<td>
+<p>Allocator type.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link3">Key-type definitions.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "30%" ALIGN = "left"><b>Type</b></TD><TD Width = "55%" ALIGN = "left"><b>Definition</b></TD><TD Width = "15%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "key_type3735929433">key_type</a></pre>
+
+
+</td>
+
+<td>
+<pre>order_statistics_key&lt;
+ <a href = "#Key3735928856">Key</a>,
+ <a href = "#Allocator3735929488">Allocator</a>&gt;</pre>
+
+
+</td>
+
+<td>
+<p>Key-type on which this functor operates.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "const_key_pointer3735929445">const_key_pointer</a></pre>
+
+
+</td>
+
+<td>
+<pre><b>typename</b> <a href = "#Allocator3735929488">Allocator</a>::<b>template</b> rebind&lt;
+ <a href = "#key_type3735929433">key_type</a>&gt;::other::const_pointer</pre>
+
+
+</td>
+
+<td>
+<p>Key pointer-type on which this functor operates.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link4">Constructors, destructor, and related.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>inline</b> <b>void</b>
+ swap
+ (<font color = "olive">order_statistics_node_updator</font> &amp;r_other)</pre>
+
+
+</td>
+
+<td>
+<p>Swaps content.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <b>void</b>
+ <b>operator</b>()
+ (<a href = "#const_key_pointer3735929445">const_key_pointer</a> p_key,
+ <a href = "#const_key_pointer3735929445">const_key_pointer</a> p_l_child_key,
+ <a href = "#const_key_pointer3735929445">const_key_pointer</a> p_r_child_key)</pre>
+
+
+</td>
+
+<td>
+<p>Updates the rank of a key given its child keys.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+
+
+</body>
+
+</html>
+
+
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/ov_tree_ds_tag.html b/libstdc++-v3/docs/html/ext/pb_assoc/ov_tree_ds_tag.html
new file mode 100644
index 0000000..38878b6
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/ov_tree_ds_tag.html
@@ -0,0 +1,74 @@
+
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+
+
+<html>
+<head>
+<title>ov_tree_ds_tag Interface
+</title>
+
+</head>
+
+<body>
+<h1>
+<tt>ov_tree_ds_tag
+</tt>
+
+ Interface
+
+
+</h1>
+
+<p>Ordered-vector tree data-structure tag.
+</p>
+
+<ol>
+<li>
+<a href = "../../../../include/ext/pb_assoc/ds_trait.hpp"><tt>ds_trait.hpp</tt>
+</a>
+
+</li>
+
+<li>
+<a href = "#link1">Base classes.
+</a>
+
+</li>
+
+</ol>
+
+
+<h2>
+<a name = "link1">Base classes.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "80%" ALIGN = "left"><b>Class</b></TD><TD Width = "20%" ALIGN = "left"><b>Derivation Type</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a href = "basic_tree_ds_tag.html"><tt>basic_tree_ds_tag</tt></a></pre>
+
+
+</td>
+
+<td>
+<p>public</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+
+
+</body>
+
+</html>
+
+
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/overview.html b/libstdc++-v3/docs/html/ext/pb_assoc/overview.html
new file mode 100644
index 0000000..0caa370
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/overview.html
@@ -0,0 +1,139 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+<html>
+ <head>
+ <title>Overview</title>
+ <meta name="GENERATOR" content="Microsoft Visual Studio .NET 7.1">
+ <meta name="vs_targetSchema" content="http://schemas.microsoft.com/intellisense/ie5">
+ </head>
+<body bgcolor = "white">
+
+
+<h1>Overview</h1>
+
+<p>
+ The <a href = "introduction.html">Introduction</a> Section described some challenges
+in designing associative containers. This section describes the <tt>pb_assoc</tt>'s solution.
+</p>
+
+
+<p>
+Figure
+<a href = "#cd">Class hierarchy</a>
+shows a class diagram of <tt>pb_assoc's associative containers.</tt>
+Associative container classes subclass other associative container classes such that
+base classes capture common types and methods
+[<a href = "references.html#stroustrup97cpp">stroustrup97cpp</a>]. The type <tt>hash_fn</tt> is defined in <a href = "basic_hash_assoc_cntnr.html"><tt>basic_hash_assoc_cntnr</tt></a>, for example, since all hash-based containers employ a hash function;
+<a href = "cc_hash_assoc_cntnr.html"><tt>cc_hash_assoc_cntnr</tt></a>
+and
+<a href = "gp_hash_assoc_cntnr.html"><tt>gp_hash_assoc_cntnr</tt></a>,
+subclasses encapsulating a collision-chaining and (general) probing hash table, respectively, each define other types specific for their underlying data-structure.
+This is described further in
+<a href = "ds_gen.html">Data-Structure Genericity</a>.
+</p>
+
+<h6 align = "center">
+<a name = "cd">
+<img src = "cd.jpg" width = "70%" alt = "no image">
+</h6>
+</a>
+<h6 align = "center">
+Class hierarchy.
+</h6>
+
+<p>
+ It is sometimes useful to know the underlying data-structure.
+Associative containers internally define <tt>ds_category</tt> as a class describing this. Two classes might be different instantiations
+of
+<a href = "tree_assoc_cntnr.html"><tt>tree_assoc_cntnr</tt></a>, but one might be based on a red-black tree while another might be based on a splay tree. (This might affect the way tree objects should be manipulated.) <tt><b>typename</b> Cntnr::ds_category</tt>
+yields a &quot;tag&quot; class for the underlying data-structure of some type
+<tt>Cntnr</tt>.
+This is described further in
+<a href = "ds_gen.html">Data-Structure Genericity</a>.
+</p>
+
+<p>
+ When manipulating generic containers, it is useful to know which types, methods, and guarantees they support. For example, tree-based containers can support split and join operations, while containers based on most other underlying data-structures cannot.
+These questions can be answered in compile time through a traits mechanism.
+<a href = "ds_traits.html"><tt>ds_traits</tt>&lt;Cntnr&gt;::split_join</a>, for example, answers the above question.
+This is described further in
+<a href = "ds_gen.html">Data-Structure Genericity</a>;
+<a href = "../example/ds_traits_example.cpp"><tt>ds_traits_example.cpp</tt></a>-
+shows an example.
+</p>
+
+<p>
+ <tt>pb_assoc</tt> does not contain separate containers for different mapping semantics,
+as the STL does (<i>e.g.</i>, <tt>std::map</tt> and <tt>std::multimap</tt>). Rather, containers are parameterized by a <tt>Data</tt> parameter, and this parameter is a policy for the mapping semantics.
+</p>
+<ol>
+ <li>
+ Instantiating a container's <tt>Data</tt> parameter by all but two distingished types, will make a &quot;map&quot;. Thus
+<pre>
+<a href = "cc_hash_assoc_cntnr.html">cc_hash_assoc_cntnr</a>&lt;
+ <b>int</b>,
+ <b>char</b>&gt;
+</pre> is a type mapping each <tt><b>int</b></tt> value to a <tt><b>char</b></tt>
+ value.
+ <a href = "../example/basic_map_example.cpp"><tt>basic_map_example.cpp</tt></a>
+ shows an example.
+ </li>
+ <li>
+ Instantiating a container's <tt>Data</tt> parameter by <a href = "null_data_type.html"><tt>null_data_type</tt></a> will make a &quot;set&quot;. Thus
+<pre>
+<a href = "cc_hash_assoc_cntnr.html">cc_hash_assoc_cntnr</a>&lt;
+ <b>int</b>,
+ <a href = "null_data_type.html">null_data_type</a>&gt;
+</pre>
+is a type storing unique <tt><b>int</b></tt> values.
+<a href = "../example/basic_set_example.cpp"><tt>basic_set_example.cpp</tt></a> shows an example.
+ </li>
+ <li>
+ Instantiating a container's <tt>Data</tt> parameter by <a href = "compound_data_type.html"><tt>compound_data_type</tt></a><tt>&lt;Cntnr&gt;</tt>, where <tt>Cntnr</tt> is a different associative container, will make a &quot;(multi)+map&quot;. Thus
+<pre>
+<a href = "cc_hash_assoc_cntnr.html">cc_hash_assoc_cntnr</a>&lt;
+ <b>int</b>,
+ <a href = "compound_data_type.html">compound_data_type</a>&lt;
+ <a href = "cc_hash_assoc_cntnr.html">cc_hash_assoc_cntnr</a>&lt;
+ <b>char</b>,
+ <a href = "null_data_type.html">null_data_type</a>&gt; &gt; &gt;
+</pre>
+ is a type
+mapping each <tt><b>int</b></tt> value to a &quot;set&quot; of <tt><b>char</b></tt>
+values.
+<a href = "../example/basic_multimap_example.cpp"><tt>basic_multimap_example.cpp</tt></a> shows an example.
+This composition is recursive, however, and more complex relationships can be built.
+<a href = "../example/mapping_level_example.cpp"><tt>mapping_level_example.cpp</tt></a> shows an example.
+ </li>
+</ol>
+
+<p>
+ The associative-container classes derive each from one of the three
+<a href = "basic_assoc_cntnr.html"><tt>basic_assoc_cntnr</tt></a> classes, depending
+on the data policy. These three base classes define different types and methods. For example, the &quot;map&quot; specialization of
+<a href = "basic_assoc_cntnr.html"><tt>basic_assoc_cntnr</tt></a>
+defines <tt><b>operator</b>[]</tt>, wherase the &quot;set&quot; specialization does not.
+This is described further in
+<a href = "ms_gen.html">Mapping-Semantic Genericity</a>.
+</p>
+
+<p>
+ <tt>pb_assoc</tt>'s design contains the concept of a <i>mapping level</i>. &quot;Map&quot; and &quot;set&quot; types have a single mapping level; A container
+mapping integers to &quot;maps&quot; mapping characters to floats has two mapping levels, since it can be viewed as a type mapping each integer to a &quot;map&quot;, or as a type mapping each pair of integer and character to a float. <tt>pb_assoc</tt> contains traits and rebind mechanisms for querying and altering the mapping levels.
+This is described further in
+<a href = "ms_gen.html">Mapping-Semantic Genericity</a>.
+</p>
+
+<p>
+ The leaf classes in Figure
+<a href = "#cd">Class hierarchy</a>
+are each parameterized by policies, easing configuring containers for different settings.
+<a href = "hash_based_containers.html">Hash-Based Containers</a> describes the design and policies of hash-based containers,
+ <a href = "tree_based_containers.html">Tree-Based Containers</a> describes the design and policies of tree-based containers, and
+ <a href = "lu_based_containers.html">List-Based Containers</a> describes the design and policies of list-based containers with update policies.
+
+</p>
+
+
+</body>
+
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/pb_assoc_ex.html b/libstdc++-v3/docs/html/ext/pb_assoc/pb_assoc_ex.html
new file mode 100644
index 0000000..8895bc2
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/pb_assoc_ex.html
@@ -0,0 +1,74 @@
+
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+
+
+<html>
+<head>
+<title>pb_assoc_ex Interface
+</title>
+
+</head>
+
+<body>
+<h1>
+<tt>pb_assoc_ex
+</tt>
+
+ Interface
+
+
+</h1>
+
+<p>Base class for pb_assoc's exceptions.
+</p>
+
+<ol>
+<li>
+<a href = "../../../../include/ext/pb_assoc/pb_assoc_ex.hpp"><tt>pb_assoc_ex.hpp</tt>
+</a>
+
+</li>
+
+<li>
+<a href = "#link1">Base classes.
+</a>
+
+</li>
+
+</ol>
+
+
+<h2>
+<a name = "link1">Base classes.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "80%" ALIGN = "left"><b>Class</b></TD><TD Width = "20%" ALIGN = "left"><b>Derivation Type</b></TD></TR>
+
+
+<tr>
+<td>
+<pre>std::logic_error</pre>
+
+
+</td>
+
+<td>
+<p>public</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+
+
+</body>
+
+</html>
+
+
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/portability.html b/libstdc++-v3/docs/html/ext/pb_assoc/portability.html
new file mode 100644
index 0000000..ab7e9c8
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/portability.html
@@ -0,0 +1,26 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+<html>
+<head>
+<title>Portability</title>
+<meta name="GENERATOR" content="Microsoft Visual Studio .NET 7.1">
+<meta name="vs_targetSchema" content="http://schemas.microsoft.com/intellisense/ie5">
+</head>
+<body bgcolor = "white">
+<h1>Portability</h1>
+
+<h2>Sucessfully Tested Compilers</h2>
+<ol>
+ <li>g++ 3.3.1</li>
+ <li>g++ 3.4.4</li>
+ <li>g++ 4</li>
+ <li>icc 8.1</li>
+ <li>Visual C++ .Net 7.1</li>
+</ol>
+
+<h2>Unsucessfully Tested Compilers</h2>
+<ol>
+ <li>g++ 2.9.6</li>
+ <li>Visual C++ 6</li>
+</ol>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/quadratic_probe_fn.html b/libstdc++-v3/docs/html/ext/pb_assoc/quadratic_probe_fn.html
new file mode 100644
index 0000000..1e3dea1
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/quadratic_probe_fn.html
@@ -0,0 +1,238 @@
+
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+
+
+<html>
+<head>
+<title>quadratic_probe_fn Interface
+</title>
+
+</head>
+
+<body>
+<h1>
+<tt>quadratic_probe_fn
+</tt>
+
+ Interface
+
+
+</h1>
+
+<p>A probe sequence policy using square increments.
+</p>
+
+<ol>
+<li>
+<a href = "../../../../include/ext/pb_assoc/hash_policy.hpp"><tt>hash_policy.hpp</tt>
+</a>
+
+</li>
+
+<li>
+<a href = "#link1">Template parameters.
+</a>
+
+</li>
+
+<li>
+Public Types and Constants:
+
+
+<ol>
+<li>
+<a href = "#link2">General definitions.
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+<li>
+Public Methods:
+
+
+<ol>
+<li>
+<a href = "#link3">Constructors, destructor, and related.
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+<li>
+Protected Methods:
+
+
+<ol>
+<li>
+<a href = "#link4">Offset methods.
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+</ol>
+
+
+<h2>
+<a name = "link1">Template parameters.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "20%" ALIGN = "left"><b>Parameter</b></TD><TD Width = "50%" ALIGN = "left"><b>Description</b></TD><TD Width = "30%" ALIGN = "left"><b>Default Value</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "Const_Key_Ref3735929850">Const_Key_Ref</a></pre>
+
+
+</td>
+
+<td>
+<p>Const key reference type.</p>
+
+
+</td>
+
+<td>
+-
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "Size_Type3735929483">Size_Type</a></pre>
+
+
+</td>
+
+<td>
+<p>Size type.</p>
+
+
+</td>
+
+<td>
+size_t
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link2">General definitions.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "30%" ALIGN = "left"><b>Type</b></TD><TD Width = "55%" ALIGN = "left"><b>Definition</b></TD><TD Width = "15%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "size_type3735929547">size_type</a></pre>
+
+
+</td>
+
+<td>
+<pre><a href = "#Size_Type3735929483">Size_Type</a></pre>
+
+
+</td>
+
+<td>
+<p>Size type.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link3">Constructors, destructor, and related.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>void</b>
+ swap
+ (<font color = "olive">quadratic_probe_fn</font> &amp;r_other)</pre>
+
+
+</td>
+
+<td>
+<p>Swaps content.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link4">Offset methods.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>inline</b> <a href = "#size_type3735929547">size_type</a>
+ <b>operator</b>()
+ (<a href = "#Const_Key_Ref3735929850">Const_Key_Ref</a> r_key,
+ <a href = "#size_type3735929547">size_type</a> i) <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Returns the <font color = "#666666"><tt>i</tt></font>-th offset from the hash value.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+
+
+</body>
+
+</html>
+
+
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/range_invalidation_guarantee.html b/libstdc++-v3/docs/html/ext/pb_assoc/range_invalidation_guarantee.html
new file mode 100644
index 0000000..f91e452
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/range_invalidation_guarantee.html
@@ -0,0 +1,74 @@
+
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+
+
+<html>
+<head>
+<title>range_invalidation_guarantee Interface
+</title>
+
+</head>
+
+<body>
+<h1>
+<tt>range_invalidation_guarantee
+</tt>
+
+ Interface
+
+
+</h1>
+
+<p>Signifies an invalidation guarantee that includes all those of its base, and additionally, that any range-type iterator (including the returns of begin() and end()) is in the correct relative positions to other range-type iterators as long as its corresponding entry has not be erased, regardless of modifications to the container object.
+</p>
+
+<ol>
+<li>
+<a href = "../../../../include/ext/pb_assoc/ds_trait.hpp"><tt>ds_trait.hpp</tt>
+</a>
+
+</li>
+
+<li>
+<a href = "#link1">Base classes.
+</a>
+
+</li>
+
+</ol>
+
+
+<h2>
+<a name = "link1">Base classes.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "80%" ALIGN = "left"><b>Class</b></TD><TD Width = "20%" ALIGN = "left"><b>Derivation Type</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a href = "find_invalidation_guarantee.html"><tt>find_invalidation_guarantee</tt></a></pre>
+
+
+</td>
+
+<td>
+<p>public</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+
+
+</body>
+
+</html>
+
+
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/rank_node_invariants.jpg b/libstdc++-v3/docs/html/ext/pb_assoc/rank_node_invariants.jpg
new file mode 100644
index 0000000..ea01b0a
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/rank_node_invariants.jpg
Binary files differ
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/rationale_null_node_updator.jpg b/libstdc++-v3/docs/html/ext/pb_assoc/rationale_null_node_updator.jpg
new file mode 100644
index 0000000..c798ec1
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/rationale_null_node_updator.jpg
Binary files differ
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/rb_tree_ds_tag.html b/libstdc++-v3/docs/html/ext/pb_assoc/rb_tree_ds_tag.html
new file mode 100644
index 0000000..5c59414
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/rb_tree_ds_tag.html
@@ -0,0 +1,74 @@
+
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+
+
+<html>
+<head>
+<title>rb_tree_ds_tag Interface
+</title>
+
+</head>
+
+<body>
+<h1>
+<tt>rb_tree_ds_tag
+</tt>
+
+ Interface
+
+
+</h1>
+
+<p>Red-black tree data-structure tag.
+</p>
+
+<ol>
+<li>
+<a href = "../../../../include/ext/pb_assoc/ds_trait.hpp"><tt>ds_trait.hpp</tt>
+</a>
+
+</li>
+
+<li>
+<a href = "#link1">Base classes.
+</a>
+
+</li>
+
+</ol>
+
+
+<h2>
+<a name = "link1">Base classes.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "80%" ALIGN = "left"><b>Class</b></TD><TD Width = "20%" ALIGN = "left"><b>Derivation Type</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a href = "basic_tree_ds_tag.html"><tt>basic_tree_ds_tag</tt></a></pre>
+
+
+</td>
+
+<td>
+<p>public</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+
+
+</body>
+
+</html>
+
+
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/reference_iterator.jpg b/libstdc++-v3/docs/html/ext/pb_assoc/reference_iterator.jpg
new file mode 100644
index 0000000..a9cc63e
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/reference_iterator.jpg
Binary files differ
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/references.html b/libstdc++-v3/docs/html/ext/pb_assoc/references.html
new file mode 100644
index 0000000..17e6790
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/references.html
@@ -0,0 +1,94 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+
+<html>
+<head>
+ <title>References</title>
+</head>
+
+<body bgcolor = "white">
+<h1>References</h1>
+<ol>
+ <li> [<a name="abrahams97exception">abrahams97exception</a>] Dave Abrahams,
+ STL Exception Handling Contract,
+ <a href="http://anubis.dkuug.dk/jtc1/sc22/wg21/docs/papers/1997/N1075.pdf">http://anubis.dkuug.dk/jtc1/sc22/wg21/docs/papers/1997/N1075.pdf</a>
+
+ <li> [<a name = "alexandrescu01modern">alexandrescu01modern</a>] Andrei Alexandrescu, <i>Modern C++ Design: Generic Programming and Design Patterns Applied</i>, Addison-Wesley Publishing Company, 2001 </li>
+
+ <li> [<a name = "andrew04mtf">andrew04mtf</a>] K. Andrew and D. Gleich, "MTF, Bit, and COMB: A Guide to Deterministic and Randomized Algorithms for the List Update Problem"</li>
+
+ <li> [<a name = "austern00noset">austern00noset</a>] Matthew Austern, "Why You shouldn't use <tt>set</tt> - and What You Should Use Instead", C++ Report, April, 2000 </li>
+
+ <li> [<a name = "austern01htprop">austern01htprop</a>] Matthew Austern, "A Proposal to Add Hashtables to the Standard Library", <a href= "http://anubis.dkuug.dk/jtc1/sc22/wg21/docs/papers/2001/n1326l.html">http://anubis.dkuug.dk/jtc1/sc22/wg21/docs/papers/2001/n1326l.html</a> </li>
+
+ <li> [<a name = "austern98segmented">austern98segmented</a>] Matthew Austern, "Segmented iterators and hierarchical algorithms", Generic Programming, April 1998, pp. 80-90 </li>
+
+ <li> [<a name = "boost_timer">boost_timer</a>], "Boost <tt>timer</tt> library", <a href = "http://www.boost.org/">http://www.boost.org</a> by Beman Dawes </li>
+
+ <li> [<a name = "boost_type_traits">boost_type_traits</a>], "Boost <tt>type_traits</tt> library", <a href = "http://www.boost.org/">http://www.boost.org</a> by John Maddock, Steve Cleary, <i>et. al.</i> </li>
+
+ <li> [<a name = "bulka99efficient">bulka99efficient</a>] D. Bulka, and D. Mayhew, "Efficient C++ Programming Techniques.", Addison-Wesley Publishing Company, Addison-Wesley, 1997 </li>
+
+ <li> [<a name = "clrs2001">clrs2001</a>] T. H. Cormen, C. E., Leiserson, R. L. Rivest, C. and Stein, "Introduction to Algorithms, 2nd ed.", MIT Press, 2001 </li>
+
+ <li> [<a name = "dinkumware_stl">dinkumware_stl</a>], "Dinkumware C++ Library Reference", <a href = "http://www.dinkumware.com/htm_cpl/index.html">http://www.dinkumware.com/htm_cpl/index.html</a> </li>
+
+ <li> [<a name = "dubhashi98neg">dubhashi98neg</a>] D. Dubashi, and D. Ranjan, "Balls and bins: A study in negative dependence.", Random Structures and Algorithms 13, 2 (1998), 99-124 </li>
+
+ <li> [<a name = "fagin79extendible">fagin79extendible</a>] R. Fagin, J. Nievergelt, N. Pippenger, and H. R. Strong, "Extendible hashing — a fast access method for dynamic files", ACM Trans. Database Syst. 4, 3 (1979), 315-344 </li>
+
+ <li> [<a name = "gamma95designpatterns">gamma95designpatterns</a>] E. Gamma, R. Helm, R. Johnson, and J. Vlissides, "Design Patterns - Elements of Reusable Object-Oriented Software", Addison-Wesley Publishing Company, Addison-Wesley, 1995 </li>
+
+ <li> [<a name = "garg86order">garg86order</a>] A. K. Garg and C. C. Gotlieb, "Order-preserving key transformations", Trans. Database Syst. 11, 2 (1986), 213-234 </li>
+
+ <li> [<a name = "genome_dna">genome_dna</a>], "Whole Genome Shotgun entries", <a href = "ftp://ftp.ebi.ac.uk/pub/databases/embl/wgs/wgs_aady01.dat.gz">ftp://ftp.ebi.ac.uk/pub/databases/embl/wgs/wgs/_aady01.dat.gz</a> </li>
+
+ <li> [<a name = "hyslop02making">hyslop02making</a>] J. Hyslop, and H. Sutter, "Making a real hash of things", C++ Report, May 2002 </li>
+
+ <li> [<a name = "jossutis01stl">jossutis01stl</a>] N. M. Jossutis, "The C++ Standard Library - A Tutorial and Reference", Addison-Wesley Publishing Company, Addison-Wesley, 2001 </li>
+
+ <li> [<a name = "kleft00sets">kleft00sets</a>] Klaus Kleft and Angelika Langer, "Are Set Iterators Mutable or Immutable?", C/C++ Users Jornal, October 2000 </li>
+
+ <li> [<a name = "knuth98sorting">knuth98sorting</a>] D. E. Knuth, "The Art of Computer Programming - Sorting and Searching", Addison-Wesley Publishing Company, Addison-Wesley, 1998 </li>
+
+ <li> [<a name = "liskov98data">liskov98data</a>] B. Liskov, "Data abstraction and hierarchy", SIGPLAN Notices 23, 5 (May 1998) </li>
+
+ <li> [<a name = "litwin80lh">litwin80lh</a>] W. Litwin, "Linear hashing: A new tool for file and table addressing", Proceedings of International Conference on Very Large Data Bases (June 1980), pp. 212-223 </li>
+
+ <li> [<a name = "metrowerks_stl">metrowerks_stl</a>], "Metrowerks CodeWarrior Pro 7 MSL C++ Reference Manual", </li>
+
+ <li> [<a name = "meyers96more">meyers96more</a>] S. Meyers, "More Effective C++: 35 New Ways to Improve Your Programs and Designs - 2nd ed.", Addison-Wesley Publishing Company, Addison-Wesley, 1996 </li>
+
+ <li> [<a name = "meyers00nonmember">meyers00nonmember</a>] S. Meyers, "How Non-Member Functions Improve Encapsulation", C/C++ Users Journal, 2000 </li>
+
+ <li> [<a name = "meyers01stl">meyers01stl</a>] S. Meyers, "Effective STL: 50 Specific Ways to Improve Your Use of the Standard Template Library", Addison-Wesley Publishing Company, Addison-Wesley, 2001 </li>
+
+ <li> [<a name = "meyers02both">meyers02both</a>] S. Meyers, "Class Template, Member Template - or Both?", C/C++ Users Journal, 2003 </li>
+
+ <li> [<a name = "motwani95random">motwani95random</a>] R. Motwani, and P. Raghavan, "Randomized Algorithms", Cambridge University Press </li>
+
+ <li> [<a name = "mscom">mscom</a>] <a href = "http://www.microsoft.com/com">COM: Component Model Object Technologies</a> </li>
+
+ <li> [<a name = "musser95rationale">musser95rationale</a>], David R. Musser, "Rationale for Adding Hash Tables to the C++ Standard Template Library" </li>
+
+ <li> [<a name = "musser96stltutorial">musser96stltutorial</a>] D. R. Musser and A. Saini, "STL Tutorial and Reference Guide", Addison-Wesley Publishing Company, Addison-Wesley, 1996 </li>
+
+ <li> [<a name = "sgi_stl">sgi_stl</a>] SGI, "Standard Template Library Programmer's Guide", <a href = "http://www.sgi.com/tech/stl">http://www.sgi.com/tech/stl</a> </li>
+
+ <li> [<a name = "sleator84amortized">sleator84amortized</a>] D. D. Sleator and R. E. Tarjan, "Amortized Efficiency of List Update Problems", ACM Symposium on Theory of Computing, 1984 </li>
+
+ <li> [<a name = "sleator85self">sleator85self</a>] D. D. Sleator and R. E. Tarjan, "Self-Adjusting Binary Search Trees", ACM Symposium on Theory of Computing, 1985 </li>
+
+ <li> [<a name = "stepanov94standard">stepanov94standard</a>] A. A. Stepanov and M. Lee", "The Standard Template Library" </li>
+
+ <li> [<a name = "stroustrup97cpp">stroustrup97cpp</a>] Bjarne Stroustrup, <i>The C++ Programming Langugage -3rd ed.</i>, Addison-Wesley Publishing Company,Reading, MA, USA, 1997 </li>
+
+ <li> [<a name = "vandevoorde2002cpptemplates">vandevoorde2002cpptemplates</a>] D. Vandevoorde, and N. M. Josuttis, "C++ Templates: The Complete Guide", Addison-Wesley Publishing Company, Addison-Wesley, 2002 </li>
+
+ <li> [<a name = "wickland96thirty">wickland96thirty</a>] C. A. Wickland, "Thirty Years Among the Dead", National Psychological Institute, Los Angeles, 1996,<a href = "http://myweb.wvnet.edu/~gsa00121/books/amongdead30.zip">http://myweb.wvnet.edu/gsa00121/books/amongdead30.zip</a></li>
+
+</ol>
+
+<HR>
+
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/regression_tests.html b/libstdc++-v3/docs/html/ext/pb_assoc/regression_tests.html
new file mode 100644
index 0000000..491be1f
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/regression_tests.html
@@ -0,0 +1,25 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+<html>
+<head>
+<title>Regression Tests</title>
+<meta name="GENERATOR" content="Microsoft Visual Studio .NET 7.1">
+<meta name="vs_targetSchema" content="http://schemas.microsoft.com/intellisense/ie5">
+</head>
+<body bgcolor = "white">
+<h1>Regression Tests</h1>
+
+
+<h2>Basic Regression</h2>
+
+
+<h2>Tree-Based Regression Tests</h2>
+
+<h3>Order-Statistics</h3>
+
+<p>
+Source code:
+<a href = "../testsuite/regression/tree_order_statistics_regression_test.cpp"><tt>tree_order_statistics_regression_test.cpp</tt></a>.
+</p>
+
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/resize_general.html b/libstdc++-v3/docs/html/ext/pb_assoc/resize_general.html
new file mode 100644
index 0000000..118e075
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/resize_general.html
@@ -0,0 +1,28 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+<html>
+<head>
+<title>Resize Policies</title>
+<meta name="GENERATOR" content="Microsoft Visual Studio .NET 7.1">
+<meta name="vs_targetSchema" content="http://schemas.microsoft.com/intellisense/ie5">
+</head>
+<body>
+<h1>Resize Policies</h1>
+
+<p>
+ A resize policy, say <tt>res_pol</tt>, should support the types and
+methods below.
+<ol>
+ <li><a href = "resize_policy_types.html">Types</a></li>
+ <li> Methods:
+ <ol>
+ <li><a href = "resize_policy_constr_dest.html">Constructors, destructor, and related</a></li>
+ <li><a href = "resize_policy_notification_methods.html">Notification methods</a></li>
+ <li><a href = "resize_policy_size_methods.html">Size methods</a></li>
+ <li><a href = "resize_policy_trigger_methods.html">Trigger methods</a></li>
+ </ol>
+ </li>
+</ol>
+</p>
+
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/resize_policies.html b/libstdc++-v3/docs/html/ext/pb_assoc/resize_policies.html
new file mode 100644
index 0000000..dbd306e
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/resize_policies.html
@@ -0,0 +1,487 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+<html>
+ <head>
+ <title>Resize Policies</title>
+ <meta name="GENERATOR" content="Microsoft Visual Studio .NET 7.1">
+ <meta name="vs_targetSchema" content="http://schemas.microsoft.com/intellisense/ie5">
+ </head>
+<body bgcolor = "white">
+<h1>Hash-Based Continers' Resize Policies</h1>
+
+<p>
+ This subsection describes resize policies. It is organized as follows:
+</p>
+
+<ol>
+ <li> The <a href = "#general">General Terms</a> Subsection describes general
+ terms.
+ </li>
+ <li> The <a href = "#size_policies">Size Policies</a> Subsection describes size
+ policies.
+ </li>
+ <li> The <a href = "#trigger_policies">Trigger Policies</a> Subsection describes trigger
+ policies.
+ </li> <li> The <a href = "#imp_pb_assoc">Implementation in <tt>pb_assoc</tt></a>
+ Subsection describes the implementation of these concepts in <tt>pb_assoc</tt>.
+ </li>
+</ol>
+
+
+<h2><a name = "general">General Terms</a></h2>
+
+<p>
+ Hash-tables, as opposed to trees, do not naturally grow or shrink. It
+is necessary to specify policies to determine how and when a hash table should change
+its size.
+</p>
+
+<p>
+ In general, resize policies can be decomposed into (probably orthogonal)
+policies:
+</p>
+<ol>
+ <li> A <i>size policy</i> indicating <i>how</i> a hash table should
+grow (<i>e.g.,</i> it should multiply by powers of 2).
+ </li>
+ <li> A <i>trigger policy</i> indicating <i>when</i> a hash table should
+grow (<i>e.g.,</i> a load factor is exceeded).
+ </li>
+</ol>
+
+
+
+<h2><a name = "size_policies">Size Policies</a></h2>
+
+<p>
+ Size policies determine how a hash table
+changes size. These policies are simple, and there are relatively
+few sensible options. An exponential-size policy (with the initial
+size and growth factors both powers of 2) works well with a
+mask-based range-hashing function (see the <a href = "hash_policies.html#hash_policies_range_hashing_policies">Range-Hashing Policies</a> subsection),
+and is the
+hard-wired policy used by Dinkumware
+[<a href = "references.html#dinkumware_stl">dinkumware_stl</a>]. A
+prime-list based policy works well with a modulo-prime range
+hashing function (see the <a href = "hash_policies.html#hash_policies_range_hashing_policies">Range-Hashing Policies</a> subsection),
+and is the
+hard-wired policy used by SGI's implementation
+[<a href = "references.html#sgi_stl">sgi_stl</a>].
+</p>
+
+
+
+
+<h2><a name = "trigger_policies">Trigger Policies</a></h2>
+
+<p>
+ Trigger policies determine when a hash table changes size.
+Following is a description of two polcies: <i>load-check</i>
+policies, and a collision-check policies.
+</p>
+
+<p>
+ Load-check policies are straightforward. The user
+specifies two factors, <i>&alpha;<sub>min</sub></i> and <i>&alpha;<sub>max</sub></i>, and
+the hash table maintains the invariant that
+</p>
+<p>
+ <i>
+ <a name = "eqn:load_factor_min_max">
+ &alpha;<sub>min</sub>
+ &le;
+ (number of stored elements) / (hash-table size)
+ &le;
+ &alpha;<sub>max</sub>
+ </a>
+ </i>
+ (1)
+ .
+</p>
+
+<p>
+ Collision-check policies work in the opposite direction of
+load-check policies. They focus on keeping the number of
+collisions moderate and hoping
+that the size of the table will not grow very large,
+instead of keeping a moderate load-factor and
+hoping that the number of collisions will be small.
+A
+maximal collision-check policy resizes when the shortest
+probe-sequence grows too large.
+</p>
+
+
+<p>
+ Consider Figure
+<a href = "#balls_and_bins">Balls and bins</a>.
+ Let the size of the hash table be denoted by <i>m</i>, the
+length of a probe sequence be denoted by <i>k</i>, and some load
+factor be denoted by &alpha;. We would like to calculate the
+minimal length of <i>k</i>, such that if there were <i>&alpha; m</i> elements
+in the hash table, a probe sequence of length <i>k</i> would be found
+with probability at most <i>1/m</i>.
+</p>
+
+<h6 align = "center">
+<a name = "balls_and_bins">
+<img src = "balls_and_bins.jpg" width = "60%" alt = "no image">
+</a>
+Balls and bins.
+</h6>
+
+
+<p>
+ Denote the probability that a probe sequence of length <i>k</i>
+appears in bin <i>i</i> by <i>p<sub>i</sub></i>, the length of the probe sequence
+of bin <i>i</i> by <i>l<sub>i</sub></i>, and assume uniform distribution.
+Then
+</p>
+ <p>
+ <a name = "eqn:prob_of_p1">
+ <i>p<sub>1</sub>
+ = </i>(3)
+ </a>
+ </p>
+ <p>
+ <i>
+ <b>P</b>(l<sub>1</sub> &ge; k)
+ =
+ </i>
+ </p>
+ <p>
+ <i><b>P</b>(l<sub>1</sub> &ge; &alpha; ( 1 + k / &alpha; - 1 )
+ &le; </i>(a)
+ </p>
+ <p>
+ <i>
+ e
+ ^
+ (
+ -
+ (
+ &alpha; ( k / &alpha; - 1 )<sup>2</sup>
+ )
+ /2
+ )
+ </i>
+ ,
+</p>
+<p>
+ where (a) follows from the Chernoff bound
+[<a href = "references.html#motwani95random">motwani95random</a>].
+To
+calculate the probability that <i>some</i> bin contains a probe
+sequence greater than <i>k</i>, we note that the <i>l<sub>i</sub></i> are
+negatively-dependent
+[<a href = "references.html#dubhashi98neg">dubhashi98neg</a>].
+Let <i><b>I</b>(.)</i>
+denote the indicator function. Then
+ <p>
+ <a name = "eqn:at_least_k_i_n_some_bin">
+ <i><b>P</b>( exists<sub>i</sub> l<sub>i</sub> &ge; k )
+ = </i>(3)
+ </a>
+ </p>
+ <p>
+ <i>
+ <b>P</b>
+ (
+ &sum; <sub>i = 1</sub><sup>m</sup>
+ <b>I</b>(l<sub>i</sub> &ge; k) &ge; 1
+ )
+ =
+ </i>
+ </p>
+ <p>
+ <i>
+ <b>P</b>
+ (
+ &sum; <sub>i = 1</sub><sup>m</sup>
+ <b>I</b>
+ (
+ l<sub>i</sub> &ge; k
+ )
+ &ge;
+ m p<sub>1</sub> ( 1 + 1 / (m p<sub>1</sub>) - 1 )
+ )
+ &le; </i>(a)
+ </p>
+ <p>
+ <i>
+ e
+ ^
+ (
+ (
+ -
+ m p<sub>1</sub>
+ (
+ 1 / (m p<sub>1</sub>) - 1
+ )
+ <sup>2</sup>
+ )
+ /
+ 2
+ )
+ ,
+ </i>
+ </p>
+<p>
+where (a) follows from the fact that the Chernoff bound can be
+applied to negatively-dependent variables
+[<a href = "references.html#dubhashi98neg">dubhashi98neg</a>].
+Inserting <a href = "#prob_of_p1">(2)</a> into
+<a href = "#at_least_k_i_n_some_bin">(3)</a>, and equating with <i>1/m</i>,
+we obtain
+</p>
+<p>
+ <i>
+ k
+ ~
+ &radic;
+ (
+ 2 &alpha; </i>ln<i> 2 m </i>ln<i>(m) )
+ )
+ </i>
+ .
+</p>
+
+
+
+
+
+
+
+
+
+<h2><a name = "imp_pb_assoc">Implementation in <tt>pb_assoc</tt></a></h2>
+
+<p>
+ The resize policies in the previous subsection are conceptually straightforward. The design
+of hash-based containers' size-related interface is complicated by some factors.
+</p>
+<ol>
+ <li> Most containers, <i>i.e.</i> lists, trees, and vectors, have a single "size" concept. There is no
+distinction between the number of entries the container holds and the number of entries it is using. This,
+of course, is not the case for hash-based containers. Moreover, even describing the
+"actual" size of a hash-based container (as opposed to its logical size) is difficult - a probing-based container
+holds entries to elements, even those it does not use, while a chaining-based container holds pointers to entries.
+ </li>
+ <li>
+ The policies mentioned above operate in terms of invariants. <i>E.g.</i> a load-check trigger policy
+maintains an invariant concerning the load factor of a container object. This is sometimes too rigid:
+ <ol>
+ <li>In some cases it is desirable to allow controlled override of an entire policy, <i>e.g.</i> by externally resizing a container object (or giving it an initial size, which is a special case of externally resizing the container).
+ </li>
+ <li>
+ In other cases it is desirable to allow changing the specifics of a policy in runtime, <i>e.g.</i>, changing the load factors of a load-check policy.
+ </li>
+ </ol>
+ </li>
+ <li>
+ Resize policies interact strongly with hash policies. Performance-wise, for example, it is undesirable to use an exponential size policy of powers of two with a modulo range-hashing function, and it is undesirable to use a prime size policy with a mask range-hashing function. In other cases, the effects are more dramatic. For example, using a quadratic probe function with an exponential size policy will probably cause cases where the container object has available entries which are never reached by the probe function. (<a href = "hash_policies.html">Hash Policies</a>
+discusses the previous concepts.)
+ </li>
+</ol>
+
+<p>
+ Clearly, the more of these points an interface addresses, the greater its flexibility but the lower its encapsulation and uniformity between associative containers.
+</p>
+
+
+
+<p>
+ This library attempts to address these types of problems by delegating all size-related functionality to
+policy classes. Hash-based containers
+are parameterized by a resize-policy class (among others), and derive publicly from
+the resize-policy class
+[<a href = "references.html#alexandrescu01modern">alexandrescu01modern</a>]
+ <i>E.g.</i>, a collision-chaining
+hash table is defined as follows:
+</p>
+<pre>
+cc_ht_map&lt;
+ <b>class</b> Key,
+ <b>class</b> Data,
+ ...
+ <b>class</b> Resize_Policy
+ ...&gt; :
+ <b>public</b> Resize_Policy
+</pre>
+
+<p>
+ The containers themselves lack any functionality or public interface for manipulating sizes. A container
+object merely forwards events to its resize policy object and queries it for needed actions.
+</p>
+
+<p>
+ Figure
+<a href = "#insert_resize_sequence_diagram1">
+Insert resize sequence diagram
+</a>
+shows a (possible) sequence diagram of an insert operation.
+The user inserts an element; the hash table
+notifies its resize policy that a search has started (point A);
+in this case, a single collision is encountered - the table
+notifies its resize policy of this (point B); the container
+finally notifies its resize policy that the search has ended (point C);
+it then queries its resize policy whether a resize is needed, and if so,
+what is the new size (points D to G); following the resize, it notifies
+the policy that a resize has completed (point H); finally, the element
+is inserted, and the policy notified (point I).
+</p>
+
+<h6 align = "center">
+<a name = "insert_resize_sequence_diagram1">
+<img src = "insert_resize_sequence_diagram1.jpg" width = "50%" alt = "no image">
+</a>
+</h6>
+<h6 align = "center">
+Insert resize sequence diagram.
+</h6>
+
+<p>
+ This addresses, to some extent, the problems mentioned above:
+</p>
+<ol>
+ <li>
+ Different instantiations of range-hashing policies can be met with different instantiations of
+ resize policies.
+ </li>
+ <li>
+ Questions on size-related interface are avoided, since the containers have no size-related methods. Thus
+ a container has no method for querying its actual size. It merely continuously forwards enough information to
+ its resize policy to answer such queries; the designer of the resize policy can decide whether, or how, to design the appropriate method. Also, a container has no methods for setting its size. It merely queries its
+resize policy for an initial size, queries it on a new size (if the resize policy indicates a resize is needed), and
+supports a <tt><b>protected virtual</b></tt> function for external resize.
+ </li>
+</ol>
+
+<p>
+ The library contains a single class for instantiating a resize policy,
+<tt>pb_assoc</tt> contains
+a standard resize policy,
+<a href = "ht_standard_resize_policy.html"><tt>ht_standard_resize_policy</tt></a> (the name is explained shortly).
+In terms of interface, it is parameterized by a boolean constant indicating whether its public interface supports
+queries of actual size and external resize operations (the inclusion and exclusion of these methods in the interface have obvious tradeoffs in terms of encapsulation and flexibility).
+([<a href = "references.html#alexandrescu01modern">alexandrescu01modern</a>] shows many techniques for
+changing between alternative interfaces at compile time.)
+</p>
+
+<p>
+As noted before,
+ size and trigger policies are usually orthogonal.
+<a href = "ht_standard_resize_policy.html"><tt>ht_standard_resize_policy</tt></a>
+is parameterized by size and trigger policies. For example,
+a collision-chaining hash table
+is typically be defined as follows:
+</p>
+<pre>
+cc_ht_map&lt;
+ key,
+ data,
+ ...
+ ht_standard_resize_policy&lt;
+ some_trigger_policy,
+ some_size_policy,
+ ...&gt; &gt;
+</pre>
+
+<p>
+ The sole function of
+<a href = "ht_standard_resize_policy.html"><tt>ht_standard_resize_policy</tt></a>
+ is to
+act as a standard delegator
+[<a href = "references.html#gamma95designpatterns">gamma95designpatterns</a>] for these
+policies.
+
+<p>
+ Figures
+<a href = "#insert_resize_sequence_diagram2">Standard resize policy trigger sequence diagram</a>
+ and
+<a href = "#insert_resize_sequence_diagram3">Standard resize policy size sequence diagram</a>
+ show sequence diagrams illustrating the interaction between
+ the standard resize policy and its trigger and size policies, respectively.
+</p>
+
+<h6 align = "center">
+<a name = "insert_resize_sequence_diagram2">
+<img src = "insert_resize_sequence_diagram2.jpg" width = "50%" alt = "no image">
+</a>
+</h6>
+<h6 align = "center">
+Standard resize policy trigger sequence diagram.
+</h6>
+
+<h6 align = "center">
+<a name = "insert_resize_sequence_diagram3">
+<img src = "insert_resize_sequence_diagram3.jpg" width = "50%" alt = "no image">
+</a>
+</h6>
+<h6 align = "center">
+Standard resize policy size sequence diagram.
+</h6>
+
+<p>
+ The library (currently) supports the following instantiations of size
+and trigger policies:
+</p>
+
+<ol>
+ <li>
+ <a href = "ht_load_check_trigger.html"><tt>ht_load_check_trigger</tt></a> implements
+ a load check trigger policy.
+ </li>
+ <li>
+ <a href = "ht_max_collision_check_grow_resize_trigger.html"><tt>ht_max_collision_check_grow_resize_trigger</tt></a>
+ implements a collision check trigger policy.
+ </li>
+ <li>
+<a href = "ht_exponential_size_policy.html"><tt>ht_exponential_size_policy</tt></a> implemens
+an exponential-size policy (which should be used with mask range hashing).
+ </li>
+ <li>
+<a href = "ht_prime_size_policy.html"><tt>ht_prime_size_policy</tt></a> implementing
+a size policy based on a sequence of primes
+[<a href = "references.html#sgi_stl">sgi_stl</a>] (which should be used with mod range hashing
+ </li>
+</ol>
+
+<p>
+ The trigger policies also support interfaces for changing their specifics which depend on compile time constants.
+</p>
+
+
+<p>
+ Figure
+<a href = "#resize_policy_cd">Resize policy class diagram</a> gives an overall picture
+of the resize-related classes.
+<tt>Container</tt> (which stands for any of the hash-based containers) is parameterized
+by <tt>Resize_Policy</tt>, from which it subclasses publicly
+[<a href = "references.html#alexandrescu01modern">alexandrescu01modern</a>].
+This class is currently instantiated only by
+<a href = "ht_standard_resize_policy.html"><tt>ht_standard_resize_policy</tt></a>.
+<a href = "ht_standard_resize_policy.html"><tt>ht_standard_resize_policy</tt></a> itself
+is parameterized by <tt>Trigger_Policy</tt> and <tt>Size_Policy</tt>.
+Currently, <tt>Trigger_Policy</tt> is instantiated by
+<a href = "ht_load_check_trigger.html"><tt>ht_load_check_trigger</tt></a>,
+or
+<a href = "ht_max_collision_check_grow_resize_trigger.html"><tt>ht_max_collision_check_grow_resize_trigger</tt></a>; <tt>Size_Policy</tt> is instantiated by
+<a href = "ht_exponential_size_policy.html"><tt>ht_exponential_size_policy</tt></a>,
+or
+<a href = "ht_prime_size_policy.html"><tt>ht_prime_size_policy</tt></a>.
+</p>
+
+
+<h6 align = "center">
+<a name = "resize_policy_cd">
+<img src = "resize_policy_cd.jpg" width = "40%" alt = "no image">
+</a>
+</h6>
+<h6 align = "center">
+Resize policy class diagram.
+</h6>
+
+
+</body>
+
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/resize_policy_cd.jpg b/libstdc++-v3/docs/html/ext/pb_assoc/resize_policy_cd.jpg
new file mode 100644
index 0000000..1d85438
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/resize_policy_cd.jpg
Binary files differ
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/restoring_node_invariants.jpg b/libstdc++-v3/docs/html/ext/pb_assoc/restoring_node_invariants.jpg
new file mode 100644
index 0000000..626b730
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/restoring_node_invariants.jpg
Binary files differ
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/sample_node_updator.hpp b/libstdc++-v3/docs/html/ext/pb_assoc/sample_node_updator.hpp
new file mode 100644
index 0000000..f862353
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/sample_node_updator.hpp
@@ -0,0 +1,116 @@
+/*
+* @file sample_node_updator.hpp
+* Contains a samle node update functor.
+*
+* Copyright Ami Tavory, IBM-HRL, 2004.
+*
+* Permission to use, copy, modify, sell, and distribute this software
+* is hereby granted without fee, provided that the above copyright notice
+* appears in all copies, and that both that copyright notice and this
+* permission notice appear in supporting documentation.
+*
+* None of the above authors, nor IBM Haifa Research Laboratories, make any
+* representation about the suitability of this software for any
+* purpose. It is provided "as is" without express or implied warranty.
+**/
+
+
+#ifndef SAMPLE_NODE_UPDATOR_HPP
+#define SAMPLE_NODE_UPDATOR_HPP
+
+
+/**
+* <class
+* description = "A sample node updator."
+* comment = "This class serves to show the interface a node update functor
+* needs to support.">
+**/
+class sample_node_updator
+{
+/**
+*******************************************************************************
+*******************************************************************************
+* <public_methods_group>
+**/
+public:
+
+ /**
+ ***************************************************************************
+ ***************************************************************************
+ ** <group description = "Conclassors, declassor, and related.">
+ **/
+
+ /*
+ * <fn description = "Default constructor."
+ * comment = "Must be default constructible.">
+ **/
+ sample_node_updator
+ ();
+ /** </fn> **/
+
+ /*
+ * <fn description = "Copy constructor."
+ * comment = "Must be copy constructible.">
+ **/
+ sample_node_updator
+ (const sample_node_updator &r_other);
+ /** </fn> **/
+
+ /*
+ * <fn description = "Swaps content."
+ * comment = "Must be swappable (if there is such a word).">
+ **/
+ inline void
+ swap
+ (sample_node_updator &r_other);
+ /** </fn> **/
+
+ /*
+ ***************************************************************************
+ ***************************************************************************
+ * </group>
+ **/
+
+
+ /**
+ ***************************************************************************
+ ***************************************************************************
+ ** <group description = "Operators.">
+ **/
+
+ /**
+ * <fn description = "This method is called by the superclass container
+ * object to update the key of a node whose invariants have been
+ * violated. p_key is a pointer to the key being updated;
+ * p_l_child_key is a pointer to the key of the left-child node of
+ * the node being updated (and is NULL if there is no such child node);
+ * p_r_child_key is a pointer to the key of the right-child node of
+ * the node being updated (and is NULL if there is no such child node)."
+ * comment = "@@sample_node_updator_const_key_pointer_comment">
+ **/
+ void
+ operator()
+ (const_key_pointer p_key,
+ const_key_pointer p_l_child_key,
+ const_key_pointer p_r_child_key);
+ /** </fn> **/
+
+ /*
+ ***************************************************************************
+ ***************************************************************************
+ * </group>
+ **/
+
+
+/**
+*******************************************************************************
+*******************************************************************************
+* </public_methods_group>
+**/
+};
+/**
+* </class>
+**/
+
+
+#endif // #ifndef SAMPLE_NODE_UPDATOR_HPP
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/sample_probe_fn.hpp b/libstdc++-v3/docs/html/ext/pb_assoc/sample_probe_fn.hpp
new file mode 100644
index 0000000..1117418
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/sample_probe_fn.hpp
@@ -0,0 +1,121 @@
+/**
+* @file sample_probe_fn.hpp
+* Contains a sample probe policy.
+*
+* Copyright Ami Tavory, IBM-HRL, 2004.
+*
+* Permission to use, copy, modify, sell, and distribute this software
+* is hereby granted without fee, provided that the above copyright notice
+* appears in all copies, and that both that copyright notice and this
+* permission notice appear in supporting documentation.
+*
+* None of the above authors, nor IBM Haifa Research Laboratories, make any
+* representation about the suitability of this software for any
+* purpose. It is provided "as is" without express or implied warranty.
+**/
+
+
+#ifndef SAMPLE_PROBE_FN_HPP
+#define SAMPLE_PROBE_FN_HPP
+
+
+/**
+* <class
+* description = "A sample probe policy."
+* comment = "This class serves to show the interface a probe functor
+* needs to support.">
+**/
+class sample_probe_fn
+{
+/**
+*******************************************************************************
+*******************************************************************************
+* <public_methods_group>
+**/
+public:
+ /**
+ ***************************************************************************
+ ***************************************************************************
+ ** <group description = "Constructors, destructor, and related.">
+ **/
+
+ /*
+ * <fn description = "Default constructor."
+ * comment = "Must be default constructible.">
+ **/
+ sample_probe_fn
+ ();
+ /** </fn> **/
+
+ /*
+ * <fn description = "Copy constructor."
+ * comment = "Must be copy constructible.">
+ **/
+ sample_probe_fn
+ (const sample_probe_fn &r_other);
+ /** </fn> **/
+
+ /*
+ * <fn description = "Swaps content."
+ * comment = "Must be swappable (if there is such a word).">
+ **/
+ inline void
+ swap
+ (sample_probe_fn &r_other);
+ /** </fn> **/
+
+ /*
+ ***************************************************************************
+ ***************************************************************************
+ * </group>
+ **/
+
+
+/**
+*******************************************************************************
+*******************************************************************************
+* </public_methods_group>
+**/
+
+
+/**
+*******************************************************************************
+*******************************************************************************
+* <protected_methods_group>
+**/
+protected:
+ /**
+ ***************************************************************************
+ ***************************************************************************
+ ** <group description = "Offset methods.">
+ **/
+
+ /*
+ * <fn description = "Returns the i-th offset from the hash value
+ * of some key r_key."
+ * comment = "@@sample_range_hashing_size_type_comment">
+ **/
+ inline size_type
+ operator()
+ (const_key_reference r_key,
+ size_type i) const;
+ /** </fn> **/
+
+ /**
+ ***************************************************************************
+ ***************************************************************************
+ ** </group">
+ **/
+
+/**
+*******************************************************************************
+*******************************************************************************
+* </protected_methods_group>
+**/
+};
+/**
+* </class>
+**/
+
+
+#endif // #ifndef SAMPLE_PROBE_FN_HPP
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/sample_probe_fn.html b/libstdc++-v3/docs/html/ext/pb_assoc/sample_probe_fn.html
new file mode 100644
index 0000000..2d4306d
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/sample_probe_fn.html
@@ -0,0 +1,177 @@
+
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+
+
+<html>
+<head>
+<title>sample_probe_fn Interface
+</title>
+
+</head>
+
+<body>
+<h1>
+<tt>sample_probe_fn
+</tt>
+
+ Interface
+
+
+</h1>
+
+<p>A sample probe policy.
+</p>
+
+<p>This class serves to show the interface a probe functor needs to support.
+</p>
+
+<ol>
+<li>
+<a href = "../doc/sample_probe_fn.hpp"><tt>sample_probe_fn.hpp</tt>
+</a>
+
+</li>
+
+<li>
+Public Methods:
+
+
+<ol>
+<li>
+<a href = "#link1">Constructors, destructor, and related.
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+<li>
+Protected Methods:
+
+
+<ol>
+<li>
+<a href = "#link2">Offset methods.
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+</ol>
+
+
+<h2>
+<a name = "link1">Constructors, destructor, and related.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre> sample_probe_fn
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Default constructor.</p>
+
+
+<p>Must be default constructible.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre> sample_probe_fn
+ (<b>const</b> sample_probe_fn &amp;r_other)</pre>
+
+
+</td>
+
+<td>
+<p>Copy constructor.</p>
+
+
+<p>Must be copy constructible.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <b>void</b>
+ swap
+ (sample_probe_fn &amp;r_other)</pre>
+
+
+</td>
+
+<td>
+<p>Swaps content.</p>
+
+
+<p>Must be swappable (if there is such a word).</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link2">Offset methods.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>inline</b> size_type
+ <b>operator</b>()
+ (const_key_reference r_key,
+ size_type i) <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Returns the <font color = "#666666"><tt>i</tt></font>-th offset from the hash value of some key <font color = "#666666"><tt>r_key</tt></font>.</p>
+
+
+<p><p><tt>size_type</tt> is the size type on which the functor operates.</p></p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+
+
+</body>
+
+</html>
+
+
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/sample_range_hashing.hpp b/libstdc++-v3/docs/html/ext/pb_assoc/sample_range_hashing.hpp
new file mode 100644
index 0000000..d22f8e2
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/sample_range_hashing.hpp
@@ -0,0 +1,147 @@
+/**
+* @file sample_range_hashing.hpp
+* Contains a range hashing policy.
+*
+* Copyright Ami Tavory, IBM-HRL, 2004.
+*
+* Permission to use, copy, modify, sell, and distribute this software
+* is hereby granted without fee, provided that the above copyright notice
+* appears in all copies, and that both that copyright notice and this
+* permission notice appear in supporting documentation.
+*
+* None of the above authors, nor IBM Haifa Research Laboratories, make any
+* representation about the suitability of this software for any
+* purpose. It is provided "as is" without express or implied warranty.
+**/
+
+
+#ifndef SAMPLE_RANGE_HASHING_HPP
+#define SAMPLE_RANGE_HASHING_HPP
+
+
+/**
+* <class
+* description = "A sample range-hashing functor."
+* comment = "This class serves to show the interface a range-hashing
+* functor needs to support.">
+**/
+class sample_range_hashing
+{
+/**
+*******************************************************************************
+*******************************************************************************
+* <public_methods_group>
+**/
+public:
+ /**
+ ***************************************************************************
+ ***************************************************************************
+ ** <group description = "Constructors, destructor, and related.">
+ **/
+
+ /*
+ * <fn description = "Default constructor."
+ * comment = "Must be default constructible.">
+ **/
+ sample_range_hashing
+ ();
+ /** </fn> **/
+
+ /*
+ * <fn description = "Copy constructor."
+ * comment = "Must be copy constructible.">
+ **/
+ sample_range_hashing
+ (const sample_range_hashing &r_other);
+ /** </fn> **/
+
+ /*
+ * <fn description = "Swaps content."
+ * comment = "Must be swappable (if there is such a word).">
+ **/
+ inline void
+ swap
+ (sample_range_hashing &r_other);
+ /** </fn> **/
+
+ /*
+ ***************************************************************************
+ ***************************************************************************
+ * </group>
+ **/
+
+/**
+*******************************************************************************
+*******************************************************************************
+* </public_methods_group>
+**/
+
+
+/**
+*******************************************************************************
+*******************************************************************************
+* <protected_methods_group>
+**/
+protected:
+
+ /**
+ ***************************************************************************
+ ***************************************************************************
+ ** <group
+ * description = "Notification methods.">
+ **/
+
+ /*
+ * <fn
+ * description = "Notifies the policy object that the container's
+ * __size has changed to size."
+ * comment = "@@sample_range_hashing_size_type_comment">
+ **/
+ void
+ notify_resized
+ (size_type size);
+ /** </fn> **/
+
+ /**
+ ***************************************************************************
+ ***************************************************************************
+ ** </group>
+ **/
+
+
+ /**
+ ***************************************************************************
+ ***************************************************************************
+ ** <group
+ * description = "Operators.">
+ **/
+
+ /*
+ * <fn description = "Transforms the __hash value hash into a
+ * ranged-hash value.">
+ * comment = "@@sample_range_hashing_size_type_comment">
+ **/
+ inline size_type
+ operator()
+ (size_type hash) const;
+ /** </fn> **/
+
+ /**
+ ***************************************************************************
+ ***************************************************************************
+ ** </group>
+ **/
+
+
+/**
+*******************************************************************************
+*******************************************************************************
+* </protected_methods_group>
+**/
+};
+/**
+* </class>
+**/
+
+
+#endif // #ifndef SAMPLE_RANGE_HASHING_HPP
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/sample_range_hashing.html b/libstdc++-v3/docs/html/ext/pb_assoc/sample_range_hashing.html
new file mode 100644
index 0000000..d65b6b7
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/sample_range_hashing.html
@@ -0,0 +1,213 @@
+
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+
+
+<html>
+<head>
+<title>sample_range_hashing Interface
+</title>
+
+</head>
+
+<body>
+<h1>
+<tt>sample_range_hashing
+</tt>
+
+ Interface
+
+
+</h1>
+
+<p>A sample range-hashing functor.
+</p>
+
+<p>This class serves to show the interface a range-hashing functor needs to support.
+</p>
+
+<ol>
+<li>
+<a href = "../doc/sample_range_hashing.hpp"><tt>sample_range_hashing.hpp</tt>
+</a>
+
+</li>
+
+<li>
+Public Methods:
+
+
+<ol>
+<li>
+<a href = "#link1">Constructors, destructor, and related.
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+<li>
+Protected Methods:
+
+
+<ol>
+<li>
+<a href = "#link2">Notification methods.
+</a>
+
+</li>
+
+<li>
+<a href = "#link3">Operators.
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+</ol>
+
+
+<h2>
+<a name = "link1">Constructors, destructor, and related.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre> sample_range_hashing
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Default constructor.</p>
+
+
+<p>Must be default constructible.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre> sample_range_hashing
+ (<b>const</b> sample_range_hashing &amp;r_other)</pre>
+
+
+</td>
+
+<td>
+<p>Copy constructor.</p>
+
+
+<p>Must be copy constructible.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <b>void</b>
+ swap
+ (sample_range_hashing &amp;r_other)</pre>
+
+
+</td>
+
+<td>
+<p>Swaps content.</p>
+
+
+<p>Must be swappable (if there is such a word).</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link2">Notification methods.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>void</b>
+ notify_resized
+ (size_type size)</pre>
+
+
+</td>
+
+<td>
+<p>Notifies the policy object that the container's size has changed to <font color = "#666666"><tt>size</tt></font>.</p>
+
+
+<p><p><tt>size_type</tt> is the size type on which the functor operates.</p></p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link3">Operators.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre>* comment = "@@sample_range_hashing_size_type_comment"&gt;
+**/
+<b>inline</b> size_type
+ <b>operator</b>()
+ (size_type hash) <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Transforms the hash value <font color = "#666666"><tt>hash</tt></font> into a ranged-hash value.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+
+
+</body>
+
+</html>
+
+
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/sample_ranged_hash_fn.hpp b/libstdc++-v3/docs/html/ext/pb_assoc/sample_ranged_hash_fn.hpp
new file mode 100644
index 0000000..32c5a49
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/sample_ranged_hash_fn.hpp
@@ -0,0 +1,141 @@
+/**
+* @file sample_ranged_hash_fn.hpp
+* Contains a ranged hash policy.
+*
+* Copyright Ami Tavory, IBM-HRL, 2004.
+*
+* Permission to use, copy, modify, sell, and distribute this software
+* is hereby granted without fee, provided that the above copyright notice
+* appears in all copies, and that both that copyright notice and this
+* permission notice appear in supporting documentation.
+*
+* None of the above authors, nor IBM Haifa Research Laboratories, make any
+* representation about the suitability of this software for any
+* purpose. It is provided "as is" without express or implied warranty.
+**/
+
+
+#ifndef SAMPLE_RANGED_HASH_FN_HPP
+#define SAMPLE_RANGED_HASH_FN_HPP
+
+
+/**
+* <class
+* description = "A sample ranged-hash functor."
+* comment = "This class serves to show the interface a ranged-hash
+* functor needs to support.">
+**/
+class sample_ranged_hash_fn
+{
+/**
+*******************************************************************************
+*******************************************************************************
+* <public_methods_group>
+**/
+public:
+ /**
+ ***************************************************************************
+ ***************************************************************************
+ ** <group description = "Constructors, destructor, and related.">
+ **/
+
+ /*
+ * <fn description = "Default constructor."
+ * comment = "Must be default constructible.">
+ **/
+ sample_ranged_hash_fn
+ ();
+ /** </fn> **/
+
+ /*
+ * <fn description = "Copy constructor."
+ * comment = "Must be copy constructible.">
+ **/
+ sample_ranged_hash_fn
+ (const sample_ranged_hash_fn &r_other);
+ /** </fn> **/
+
+ /*
+ * <fn description = "Swaps content."
+ * comment = "Must be swappable (if there is such a word).">
+ **/
+ inline void
+ swap
+ (sample_ranged_hash_fn &r_other);
+ /** </fn> **/
+
+ /*
+ ***************************************************************************
+ ***************************************************************************
+ * </group>
+ **/
+
+/**
+*******************************************************************************
+*******************************************************************************
+* </public_methods_group>
+**/
+
+
+/**
+*******************************************************************************
+*******************************************************************************
+* <protected_methods_group>
+**/
+protected:
+
+ /**
+ ***************************************************************************
+ ***************************************************************************
+ ** <group
+ * description = "Notification methods.">
+ **/
+
+ /*
+ * <fn
+ * description = "Notifies the policy object that the container's
+ * __size has changed to size."
+ * comment = "@@sample_ranged_hash_fn_size_type_comment">
+ **/
+ void
+ notify_resized
+ (size_type size);
+ /** </fn> **/
+
+ /**
+ ***************************************************************************
+ ***************************************************************************
+ ** </group>
+ **/
+
+
+ /**
+ ***************************************************************************
+ ***************************************************************************
+ ** <group
+ * description = "Operators.">
+ **/
+
+ /*
+ * <fn description = "Transforms the const key reference
+ * r_key into a position
+ * within the table.">
+ * comment = "@@sample_ranged_hash_fn_size_type_comment">
+ **/
+ inline size_type
+ operator()
+ (const_key_reference r_key) const;
+ /** </fn> **/
+
+ /**
+ ***************************************************************************
+ ***************************************************************************
+ ** </group>
+ **/
+};
+/**
+* </class>
+**/
+
+
+#endif // #ifndef SAMPLE_RANGED_HASH_FN_HPP
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/sample_ranged_hash_fn.html b/libstdc++-v3/docs/html/ext/pb_assoc/sample_ranged_hash_fn.html
new file mode 100644
index 0000000..d367521
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/sample_ranged_hash_fn.html
@@ -0,0 +1,129 @@
+
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+
+
+<html>
+<head>
+<title>sample_ranged_hash_fn Interface
+</title>
+
+</head>
+
+<body>
+<h1>
+<tt>sample_ranged_hash_fn
+</tt>
+
+ Interface
+
+
+</h1>
+
+<p>A sample ranged-hash functor.
+</p>
+
+<p>This class serves to show the interface a ranged-hash functor needs to support.
+</p>
+
+<ol>
+<li>
+<a href = "../doc/sample_ranged_hash_fn.hpp"><tt>sample_ranged_hash_fn.hpp</tt>
+</a>
+
+</li>
+
+<li>
+Public Methods:
+
+
+<ol>
+<li>
+<a href = "#link1">Constructors, destructor, and related.
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+</ol>
+
+
+<h2>
+<a name = "link1">Constructors, destructor, and related.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre> sample_ranged_hash_fn
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Default constructor.</p>
+
+
+<p>Must be default constructible.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre> sample_ranged_hash_fn
+ (<b>const</b> sample_ranged_hash_fn &amp;r_other)</pre>
+
+
+</td>
+
+<td>
+<p>Copy constructor.</p>
+
+
+<p>Must be copy constructible.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <b>void</b>
+ swap
+ (sample_ranged_hash_fn &amp;r_other)</pre>
+
+
+</td>
+
+<td>
+<p>Swaps content.</p>
+
+
+<p>Must be swappable (if there is such a word).</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+
+
+</body>
+
+</html>
+
+
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/sample_ranged_probe_fn.hpp b/libstdc++-v3/docs/html/ext/pb_assoc/sample_ranged_probe_fn.hpp
new file mode 100644
index 0000000..2aaab0e
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/sample_ranged_probe_fn.hpp
@@ -0,0 +1,143 @@
+/**
+* @file sample_ranged_probe_fn.hpp
+* Contains a ranged probe policy.
+*
+* Copyright Ami Tavory, IBM-HRL, 2004.
+*
+* Permission to use, copy, modify, sell, and distribute this software
+* is hereby granted without fee, provided that the above copyright notice
+* appears in all copies, and that both that copyright notice and this
+* permission notice appear in supporting documentation.
+*
+* None of the above authors, nor IBM Haifa Research Laboratories, make any
+* representation about the suitability of this software for any
+* purpose. It is provided "as is" without express or implied warranty.
+**/
+
+
+#ifndef SAMPLE_RANGED_PROBE_FN_HPP
+#define SAMPLE_RANGED_PROBE_FN_HPP
+
+
+/**
+* <class
+* description = "A sample ranged-probe functor."
+* comment = "This class serves to show the interface a ranged-probe
+* functor needs to support.">
+**/
+class sample_ranged_probe_fn
+{
+/**
+*******************************************************************************
+*******************************************************************************
+* <public_methods_group>
+**/
+public:
+ /**
+ ***************************************************************************
+ ***************************************************************************
+ ** <group description = "Constructors, destructor, and related.">
+ **/
+
+ /*
+ * <fn description = "Default constructor."
+ * comment = "Must be default constructible.">
+ **/
+ sample_ranged_probe_fn
+ ();
+ /** </fn> **/
+
+ /*
+ * <fn description = "Copy constructor."
+ * comment = "Must be copy constructible.">
+ **/
+ sample_ranged_probe_fn
+ (const sample_ranged_probe_fn &r_other);
+ /** </fn> **/
+
+ /*
+ * <fn description = "Swaps content."
+ * comment = "Must be swappable (if there is such a word).">
+ **/
+ inline void
+ swap
+ (sample_ranged_probe_fn &r_other);
+ /** </fn> **/
+
+ /*
+ ***************************************************************************
+ ***************************************************************************
+ * </group>
+ **/
+
+/**
+*******************************************************************************
+*******************************************************************************
+* </public_methods_group>
+**/
+
+
+/**
+*******************************************************************************
+*******************************************************************************
+* <protected_methods_group>
+**/
+protected:
+
+ /**
+ ***************************************************************************
+ ***************************************************************************
+ ** <group
+ * description = "Notification methods.">
+ **/
+
+ /*
+ * <fn
+ * description = "Notifies the policy object that the container's
+ * __size has changed to size."
+ * comment = "@@sample_ranged_probe_fn_size_type_comment">
+ **/
+ void
+ notify_resized
+ (size_type size);
+ /** </fn> **/
+
+ /**
+ ***************************************************************************
+ ***************************************************************************
+ ** </group>
+ **/
+
+
+ /**
+ ***************************************************************************
+ ***************************************************************************
+ ** <group
+ * description = "Operators.">
+ **/
+
+ /*
+ * <fn description = "Transforms the const key reference
+ * r_key into the i-th position
+ * within the table. This method is called for
+ * each collision within the probe sequence.">
+ * comment = "@@sample_ranged_probe_fn_size_type_comment">
+ **/
+ inline size_type
+ operator()
+ (const_key_reference r_key,
+ size_type i) const;
+ /** </fn> **/
+
+ /**
+ ***************************************************************************
+ ***************************************************************************
+ ** </group>
+ **/
+};
+/**
+* </class>
+**/
+
+
+#endif // #ifndef SAMPLE_RANGED_PROBE_FN_HPP
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/sample_ranged_probe_fn.html b/libstdc++-v3/docs/html/ext/pb_assoc/sample_ranged_probe_fn.html
new file mode 100644
index 0000000..95eee87
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/sample_ranged_probe_fn.html
@@ -0,0 +1,129 @@
+
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+
+
+<html>
+<head>
+<title>sample_ranged_probe_fn Interface
+</title>
+
+</head>
+
+<body>
+<h1>
+<tt>sample_ranged_probe_fn
+</tt>
+
+ Interface
+
+
+</h1>
+
+<p>A sample ranged-probe functor.
+</p>
+
+<p>This class serves to show the interface a ranged-probe functor needs to support.
+</p>
+
+<ol>
+<li>
+<a href = "../doc/sample_ranged_probe_fn.hpp"><tt>sample_ranged_probe_fn.hpp</tt>
+</a>
+
+</li>
+
+<li>
+Public Methods:
+
+
+<ol>
+<li>
+<a href = "#link1">Constructors, destructor, and related.
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+</ol>
+
+
+<h2>
+<a name = "link1">Constructors, destructor, and related.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre> sample_ranged_probe_fn
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Default constructor.</p>
+
+
+<p>Must be default constructible.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre> sample_ranged_probe_fn
+ (<b>const</b> sample_ranged_probe_fn &amp;r_other)</pre>
+
+
+</td>
+
+<td>
+<p>Copy constructor.</p>
+
+
+<p>Must be copy constructible.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <b>void</b>
+ swap
+ (sample_ranged_probe_fn &amp;r_other)</pre>
+
+
+</td>
+
+<td>
+<p>Swaps content.</p>
+
+
+<p>Must be swappable (if there is such a word).</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+
+
+</body>
+
+</html>
+
+
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/sample_resize_policy.hpp b/libstdc++-v3/docs/html/ext/pb_assoc/sample_resize_policy.hpp
new file mode 100644
index 0000000..4101a70
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/sample_resize_policy.hpp
@@ -0,0 +1,310 @@
+/**
+* @file sample_resize_policy.hpp
+* Contains a sample resize policy for hash tables.
+*
+* Copyright Ami Tavory, IBM-HRL, 2004.
+*
+* Permission to use, copy, modify, sell, and distribute this software
+* is hereby granted without fee, provided that the above copyright notice
+* appears in all copies, and that both that copyright notice and this
+* permission notice appear in supporting documentation,
+*
+* None of the above authors, nor IBM Haifa Research Laboratories, make any
+* representation about the suitability of this software for any
+* purpose. It is provided "as is" without express or implied warranty.
+**/
+
+
+#ifndef SAMPLE_RESIZE_POLICY_HPP
+#define SAMPLE_RESIZE_POLICY_HPP
+
+
+/**
+* <class
+* description = "A sample resize policy."
+* comment = "This class serves to show the interface a resize policy
+* needs to support.">
+**/
+class sample_resize_policy
+{
+/**
+*******************************************************************************
+*******************************************************************************
+* <public_methods_group>
+**/
+public:
+ /**
+ ***************************************************************************
+ ***************************************************************************
+ ** <group description = "Constructors, destructor, and related.">
+ **/
+
+ /*
+ * <fn description = "Default constructor."
+ * comment = "Must be default constructible.">
+ **/
+ sample_resize_policy
+ ();
+ /** </fn> **/
+
+ /*
+ * <fn description = "Copy constructor."
+ * comment = "Must be copy constructible.">
+ **/
+ sample_range_hashing
+ (const sample_resize_policy &r_other);
+ /** </fn> **/
+
+ /*
+ * <fn description = "Swaps content."
+ * comment = "Must be swappable (if there is such a word).">
+ **/
+ inline void
+ swap
+ (sample_resize_policy &r_other);
+ /** </fn> **/
+
+ /*
+ ***************************************************************************
+ ***************************************************************************
+ * </group>
+ **/
+
+
+/**
+*******************************************************************************
+*******************************************************************************
+* </public_methods_group>
+**/
+
+
+/**
+*******************************************************************************
+*******************************************************************************
+* <protected_methods_group>
+**/
+protected:
+ /**
+ ***************************************************************************
+ ***************************************************************************
+ ** <group description = "Insert search notifications."
+ ** comment = "Notifications called during an insert operation.">
+ **/
+
+ /*
+ * <fn description = "Notifies a search started.">
+ **/
+ inline void
+ notify_insert_search_start
+ ();
+ /** </fn> **/
+
+ /*
+ * <fn description = "Notifies a search encountered a collision.">
+ **/
+ inline void
+ notify_insert_search_collision
+ ();
+ /** </fn> **/
+
+ /*
+ * <fn description = "Notifies a search ended.">
+ **/
+ inline void
+ notify_insert_search_end
+ ();
+ /** </fn> **/
+
+ /*
+ ***************************************************************************
+ ***************************************************************************
+ * </group>
+ **/
+
+
+ /**
+ ***************************************************************************
+ ***************************************************************************
+ ** <group description = "Find search notifications."
+ ** comment = "Notifications called during a find operation.">
+ **/
+
+ /*
+ * <fn description = "Notifies a search started.">
+ **/
+ inline void
+ notify_find_search_start
+ ();
+ /** </fn> **/
+
+ /*
+ * <fn description = "Notifies a search encountered a collision.">
+ **/
+ inline void
+ notify_find_search_collision
+ ();
+ /** </fn> **/
+
+ /*
+ * <fn description = "Notifies a search ended.">
+ **/
+ inline void
+ notify_find_search_end
+ ();
+ /** </fn> **/
+
+ /*
+ ***************************************************************************
+ ***************************************************************************
+ * </group>
+ **/
+
+
+ /**
+ ***************************************************************************
+ ***************************************************************************
+ ** <group description = "Erase search notifications."
+ ** comment = "Notifications called during an insert operation.">
+ **/
+
+ /*
+ * <fn description = "Notifies a search started.">
+ **/
+ inline void
+ notify_erase_search_start
+ ();
+ /** </fn> **/
+
+ /*
+ * <fn description = "Notifies a search encountered a collision.">
+ **/
+ inline void
+ notify_erase_search_collision
+ ();
+ /** </fn> **/
+
+ /*
+ * <fn description = "Notifies a search ended.">
+ **/
+ inline void
+ notify_erase_search_end
+ ();
+ /** </fn> **/
+
+ /*
+ ***************************************************************************
+ ***************************************************************************
+ * </group>
+ **/
+
+
+ /**
+ ***************************************************************************
+ ***************************************************************************
+ ** <group description = "Content change notifications."
+ ** comment = "Notifications called when the content of the table
+ ** changes in a way that can affect the resize policy.">
+ **/
+
+ /*
+ * <fn description = "Notifies an element was inserted.">
+ **/
+ inline void
+ notify_inserted
+ (size_type num_e);
+ /** </fn> **/
+
+ /*
+ * <fn description = "Notifies an element was erased.">
+ **/
+ inline void
+ notify_erased
+ (size_type num_e);
+ /** </fn> **/
+
+ /*
+ * <fn description = "Notifies the table was cleared.">
+ **/
+ void
+ notify_cleared
+ ();
+ /** </fn> **/
+
+ /*
+ ***************************************************************************
+ ***************************************************************************
+ * </group>
+ **/
+
+
+ /**
+ ***************************************************************************
+ ***************************************************************************
+ ** <group description = "Size change notifications."
+ ** comment = "Notifications called when the table changes size.">
+ **/
+
+ /*
+ * <fn description = "Notifies the table was resized to new_size.">
+ **/
+ void
+ notify_resized
+ (size_type new_size);
+ /** </fn> **/
+
+ /*
+ ***************************************************************************
+ ***************************************************************************
+ * </group>
+ **/
+
+
+ /**
+ ***************************************************************************
+ ***************************************************************************
+ ** <group description = "Queries."
+ ** comment = "Called to query whether/how to resize.">
+ **/
+
+ /*
+ * <fn description = "Queries initial size.">
+ **/
+ size_type
+ get_init_size
+ () const;
+ /** </fn> **/
+
+ /*
+ * <fn description = "Queries whether a resize is needed.">
+ **/
+ inline bool
+ is_resize_needed
+ () const;
+ /** </fn> **/
+
+ /*
+ * <fn description = "Queries what the new size should be.">
+ **/
+ size_type
+ get_new_size
+ (size_type size, size_type num_used_e) const;
+ /** </fn> **/
+
+ /*
+ ***************************************************************************
+ ***************************************************************************
+ * </group>
+ **/
+
+/**
+*******************************************************************************
+*******************************************************************************
+* </protected_methods_group>
+**/
+};
+/**
+* </class>
+**/
+
+
+#endif // #ifndef SAMPLE_RESIZE_POLICY_HPP
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/sample_resize_policy.html b/libstdc++-v3/docs/html/ext/pb_assoc/sample_resize_policy.html
new file mode 100644
index 0000000..bb743ab
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/sample_resize_policy.html
@@ -0,0 +1,536 @@
+
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+
+
+<html>
+<head>
+<title>sample_resize_policy Interface
+</title>
+
+</head>
+
+<body>
+<h1>
+<tt>sample_resize_policy
+</tt>
+
+ Interface
+
+
+</h1>
+
+<p>A sample resize policy.
+</p>
+
+<p>This class serves to show the interface a resize policy needs to support.
+</p>
+
+<ol>
+<li>
+<a href = "../doc/sample_resize_policy.hpp"><tt>sample_resize_policy.hpp</tt>
+</a>
+
+</li>
+
+<li>
+Public Methods:
+
+
+<ol>
+<li>
+<a href = "#link1">Constructors, destructor, and related.
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+<li>
+Protected Methods:
+
+
+<ol>
+<li>
+<a href = "#link2">Insert search notifications.
+</a>
+
+</li>
+
+<li>
+<a href = "#link3">Find search notifications.
+</a>
+
+</li>
+
+<li>
+<a href = "#link4">Erase search notifications.
+</a>
+
+</li>
+
+<li>
+<a href = "#link5">Content change notifications.
+</a>
+
+</li>
+
+<li>
+<a href = "#link6">Size change notifications.
+</a>
+
+</li>
+
+<li>
+<a href = "#link7">Queries.
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+</ol>
+
+
+<h2>
+<a name = "link1">Constructors, destructor, and related.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre> sample_resize_policy
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Default constructor.</p>
+
+
+<p>Must be default constructible.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre> sample_range_hashing
+ (<b>const</b> sample_resize_policy &amp;r_other)</pre>
+
+
+</td>
+
+<td>
+<p>Copy constructor.</p>
+
+
+<p>Must be copy constructible.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <b>void</b>
+ swap
+ (sample_resize_policy &amp;r_other)</pre>
+
+
+</td>
+
+<td>
+<p>Swaps content.</p>
+
+
+<p>Must be swappable (if there is such a word).</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link2">Insert search notifications.
+</a>
+
+</h2>
+
+<p>Notifications called during an insert operation.</p>
+
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>inline</b> <b>void</b>
+ notify_insert_search_start
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Notifies a search started.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <b>void</b>
+ notify_insert_search_collision
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Notifies a search encountered a collision.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <b>void</b>
+ notify_insert_search_end
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Notifies a search ended.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link3">Find search notifications.
+</a>
+
+</h2>
+
+<p>Notifications called during a find operation.</p>
+
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>inline</b> <b>void</b>
+ notify_find_search_start
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Notifies a search started.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <b>void</b>
+ notify_find_search_collision
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Notifies a search encountered a collision.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <b>void</b>
+ notify_find_search_end
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Notifies a search ended.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link4">Erase search notifications.
+</a>
+
+</h2>
+
+<p>Notifications called during an insert operation.</p>
+
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>inline</b> <b>void</b>
+ notify_erase_search_start
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Notifies a search started.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <b>void</b>
+ notify_erase_search_collision
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Notifies a search encountered a collision.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <b>void</b>
+ notify_erase_search_end
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Notifies a search ended.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link5">Content change notifications.
+</a>
+
+</h2>
+
+<p>Notifications called when the content of the table changes in a way that can affect the resize policy.</p>
+
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>inline</b> <b>void</b>
+ notify_inserted
+ (size_type num_e)</pre>
+
+
+</td>
+
+<td>
+<p>Notifies an element was inserted.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <b>void</b>
+ notify_erased
+ (size_type num_e)</pre>
+
+
+</td>
+
+<td>
+<p>Notifies an element was erased.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>void</b>
+ notify_cleared
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Notifies the table was cleared.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link6">Size change notifications.
+</a>
+
+</h2>
+
+<p>Notifications called when the table changes size.</p>
+
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>void</b>
+ notify_resized
+ (size_type new_size)</pre>
+
+
+</td>
+
+<td>
+<p>Notifies the table was resized to <font color = "#666666"><tt>new_size</tt></font>.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link7">Queries.
+</a>
+
+</h2>
+
+<p>Called to query whether/how to resize.</p>
+
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre>size_type
+ get_init_size
+ () <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Queries initial size.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <b>bool</b>
+ is_resize_needed
+ () <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Queries whether a resize is needed.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre>size_type
+ get_new_size
+ (size_type size, size_type num_used_e) <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Queries what the new <font color = "#666666"><tt>size</tt></font> should be.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+
+
+</body>
+
+</html>
+
+
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/sample_resize_trigger.hpp b/libstdc++-v3/docs/html/ext/pb_assoc/sample_resize_trigger.hpp
new file mode 100644
index 0000000..b2799cf
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/sample_resize_trigger.hpp
@@ -0,0 +1,341 @@
+/**
+* @file sample_resize_trigger.hpp
+* Contains a sample resize trigger policy class.
+*
+* Copyright Ami Tavory, IBM-HRL, 2004.
+*
+* Permission to use, copy, modify, sell, and distribute this software
+* is hereby granted without fee, provided that the above copyright notice
+* appears in all copies, and that both that copyright notice and this
+* permission notice appear in supporting documentation.
+*
+* None of the above authors, nor IBM Haifa Research Laboratories, make any
+* representation about the suitability of this software for any
+* purpose. It is provided "as is" without express or implied warranty.
+**/
+
+
+#ifndef SAMPLE_RESIZE_TRIGGER_HPP
+#define SAMPLE_RESIZE_TRIGGER_HPP
+
+
+/**
+* <class
+* description = "A sample resize trigger policy."
+* comment = "This class serves to show the interface a trigger policy
+* needs to support.">
+**/
+class sample_resize_trigger
+{
+/**
+*******************************************************************************
+*******************************************************************************
+* <public_methods_group>
+**/
+public:
+ /**
+ ***************************************************************************
+ ***************************************************************************
+ ** <group description = "Constructors, destructor, and related.">
+ **/
+
+ /*
+ * <fn description = "Default constructor."
+ * comment = "Must be default constructible.">
+ **/
+ sample_resize_trigger
+ ();
+ /** </fn> **/
+
+ /*
+ * <fn description = "Copy constructor."
+ * comment = "Must be copy constructible.">
+ **/
+ sample_range_hashing
+ (const sample_resize_trigger &r_other);
+ /** </fn> **/
+
+ /*
+ * <fn description = "Swaps content."
+ * comment = "Must be swappable (if there is such a word).">
+ **/
+ inline void
+ swap
+ (sample_resize_trigger &r_other);
+ /** </fn> **/
+
+ /*
+ ***************************************************************************
+ ***************************************************************************
+ * </group>
+ **/
+
+
+/**
+*******************************************************************************
+*******************************************************************************
+* </public_methods_group>
+**/
+
+
+/**
+*******************************************************************************
+*******************************************************************************
+* <protected_methods_group>
+**/
+protected:
+ /**
+ **************************************************************************
+ ***************************************************************************
+ ** <group description = "Insert search notifications."
+ ** comment = "Notifications called during an insert operation.">
+ **/
+
+ /*
+ * <fn description = "Notifies a search started.">
+ **/
+ inline void
+ notify_insert_search_start
+ ();
+ /** </fn> **/
+
+ /*
+ * <fn description = "Notifies a search encountered a collision.">
+ **/
+ inline void
+ notify_insert_search_collision
+ ();
+ /** </fn> **/
+
+ /*
+ * <fn description = "Notifies a search ended.">
+ **/
+ inline void
+ notify_insert_search_end
+ ();
+ /** </fn> **/
+
+ /*
+ ***************************************************************************
+ ***************************************************************************
+ * </group>
+ **/
+
+
+ /**
+ ***************************************************************************
+ ***************************************************************************
+ ** <group description = "Find search notifications."
+ ** comment = "Notifications called during a find operation.">
+ **/
+
+ /*
+ * <fn description = "Notifies a search started.">
+ **/
+ inline void
+ notify_find_search_start
+ ();
+ /** </fn> **/
+
+ /*
+ * <fn description = "Notifies a search encountered a collision.">
+ **/
+ inline void
+ notify_find_search_collision
+ ();
+ /** </fn> **/
+
+ /*
+ * <fn description = "Notifies a search ended.">
+ **/
+ inline void
+ notify_find_search_end
+ ();
+ /** </fn> **/
+
+ /*
+ ***************************************************************************
+ ***************************************************************************
+ * </group>
+ **/
+
+
+ /**
+ ***************************************************************************
+ ***************************************************************************
+ ** <group description = "Erase search notifications."
+ ** comment = "Notifications called during an insert operation.">
+ **/
+
+ /*
+ * <fn description = "Notifies a search started.">
+ **/
+ inline void
+ notify_erase_search_start
+ ();
+ /** </fn> **/
+
+ /*
+ * <fn description = "Notifies a search encountered a collision.">
+ **/
+ inline void
+ notify_erase_search_collision
+ ();
+ /** </fn> **/
+
+ /*
+ * <fn description = "Notifies a search ended.">
+ **/
+ inline void
+ notify_erase_search_end
+ ();
+ /** </fn> **/
+
+ /*
+ ***************************************************************************
+ ***************************************************************************
+ * </group>
+ **/
+
+
+ /**
+ ***************************************************************************
+ ***************************************************************************
+ ** <group description = "Content change notifications."
+ ** comment = "Notifications called when the content of the table
+ ** changes in a way that can affect the resize policy.">
+ **/
+
+ /*
+ * <fn description = "Notifies an element was inserted.
+ * the total number of entries in the table is num_entries.">
+ **/
+ inline void
+ notify_inserted
+ (size_type num_entries);
+ /** </fn> **/
+
+ /*
+ * <fn description = "Notifies an element was erased."
+ * the total number of entries in the table is num_entries.">
+ **/
+ inline void
+ notify_erased
+ (size_type num_entries);
+ /** </fn> **/
+
+ /*
+ * <fn description = "Notifies the table was cleared.">
+ **/
+ void
+ notify_cleared
+ ();
+ /** </fn> **/
+
+ /*
+ ***************************************************************************
+ ***************************************************************************
+ * </group>
+ **/
+
+
+ /**
+ ***************************************************************************
+ ***************************************************************************
+ ** <group description = "Size change notifications."
+ ** comment = "Notifications called when the table changes size.">
+ **/
+
+ /*
+ * <fn description = "Notifies the table was resized as a result of
+ * this object's signifying that a resize is needed."
+ * The actual size of the table is new_size.">
+ **/
+ void
+ notify_resized
+ (size_type new_size);
+ /** </fn> **/
+
+ /*
+ * <fn description = "Notifies the table was resized externally."
+ * The actual size of the table is new_size.">
+ **/
+ void
+ notify_externally_resized
+ (size_type new_size);
+ /** </fn> **/
+
+ /*
+ ***************************************************************************
+ ***************************************************************************
+ * </group>
+ **/
+
+
+ /**
+ ***************************************************************************
+ ***************************************************************************
+ ** <group description = "Queries."
+ ** comment = "Called to query whether/how to resize.">
+ **/
+
+ /*
+ * <fn description = "Queries whether a resize is needed.">
+ **/
+ inline bool
+ is_resize_needed
+ () const;
+ /** </fn> **/
+
+ /*
+ * <fn description = "Queries whether a grow is needed."
+ * comment = "This method is
+ * called only if this object indicated resize is needed.
+ * The actual size of the table is size, and the number of
+ * entries in it is num_entries.">
+ **/
+ inline bool
+ is_grow_needed
+ (size_type size,
+ size_type num_entries) const;
+ /** </fn> **/
+
+ /*
+ * <fn description = "Queries whether a shrink is needed."
+ * comment = "This method is
+ * called only if this object indicated resize is needed.
+ * The actual size of the table is size, and the number of
+ * entries in it is num_entries.">
+ **/
+ inline bool
+ is_shrink_needed
+ (size_type size,
+ size_type num_entries) const;
+ /** </fn> **/
+
+ /*
+ ***************************************************************************
+ ***************************************************************************
+ * </group>
+ **/
+
+
+/**
+*******************************************************************************
+*******************************************************************************
+* </protected_methods_group>
+**/
+};
+/**
+* </class>
+**/
+
+
+/*
+****************************************************************************
+****************************************************************************
+*/
+} // namespace pb_assoc
+
+
+#endif // #ifndef SAMPLE_RESIZE_TRIGGER_HPP
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/sample_size_policy.hpp b/libstdc++-v3/docs/html/ext/pb_assoc/sample_size_policy.hpp
new file mode 100644
index 0000000..a864270
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/sample_size_policy.hpp
@@ -0,0 +1,140 @@
+/**
+* @file sample_size_policy.hpp
+* Contains a sample size resize-policy.
+*
+* Copyright Ami Tavory, IBM-HRL, 2004.
+*
+* Permission to use, copy, modify, sell, and distribute this software
+* is hereby granted without fee, provided that the above copyright notice
+* appears in all copies, and that both that copyright notice and this
+* permission notice appear in supporting documentation.
+*
+* None of the above authors, nor IBM Haifa Research Laboratories, make any
+* representation about the suitability of this software for any
+* purpose. It is provided "as is" without express or implied warranty.
+**/
+
+
+#ifndef SAMPLE_SIZE_POLICY_HPP
+#define SAMPLE_SIZE_POLICY_HPP
+
+
+/**
+* <class
+* description = "A sample size policy."
+* comment = "This class serves to show the interface a size policy
+* needs to support.">
+**/
+class sample_size_policy
+{
+/**
+*******************************************************************************
+*******************************************************************************
+* <public_methods_group>
+**/
+public:
+ /**
+ ***************************************************************************
+ ***************************************************************************
+ ** <group description = "Constructors, destructor, and related.">
+ **/
+
+ /*
+ * <fn description = "Default constructor."
+ * comment = "Must be default constructible.">
+ **/
+ sample_size_policy
+ ();
+ /** </fn> **/
+
+ /*
+ * <fn description = "Copy constructor."
+ * comment = "Must be copy constructible.">
+ **/
+ sample_range_hashing
+ (const sample_size_policy &r_other);
+ /** </fn> **/
+
+ /*
+ * <fn description = "Swaps content."
+ * comment = "Must be swappable (if there is such a word).">
+ **/
+ inline void
+ swap
+ (sample_size_policy &r_other);
+ /** </fn> **/
+
+ /*
+ ***************************************************************************
+ ***************************************************************************
+ * </group>
+ **/
+
+
+/**
+*******************************************************************************
+*******************************************************************************
+* </public_methods_group>
+**/
+
+
+/**
+*******************************************************************************
+*******************************************************************************
+* <protected_methods_group>
+**/
+protected:
+
+ /**
+ **************************************************************************
+ ***************************************************************************
+ ** <group description = "Size methods">
+ **/
+
+ /*
+ * <fn description = "Given suggested_size, a suggested size, returns
+ * an initial size of the container related to the initial size.">
+ **/
+ inline size_type
+ get_init_size
+ (size_type suggested_size) const;
+ /** </fn> **/
+
+ /*
+ * <fn description = "Given cur_size, the
+ * current size, returns a size that is
+ * larger.">
+ **/
+ inline size_type
+ get_nearest_larger_size
+ (size_type cur_size) const;
+ /** </fn> **/
+
+ /*
+ * <fn description = "Given cur_size, the current size, returns a size that is
+ * smaller.">
+ **/
+ inline size_type
+ get_nearest_smaller_size
+ (size_type cur_size) const;
+ /** </fn> **/
+
+ /**
+ **************************************************************************
+ ***************************************************************************
+ ** </group>
+ **/
+
+
+/**
+*******************************************************************************
+*******************************************************************************
+* </protected_methods_group>
+**/
+};
+/*
+** </class>
+**/
+
+
+#endif // #ifndef SAMPLE_SIZE_POLICY_HPP
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/sample_update_policy.hpp b/libstdc++-v3/docs/html/ext/pb_assoc/sample_update_policy.hpp
new file mode 100644
index 0000000..70a1bd4
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/sample_update_policy.hpp
@@ -0,0 +1,171 @@
+/**
+* @file sample_update_policy.hpp
+* Contains a sample policy for list update containers.
+*
+* Copyright Ami Tavory, IBM-HRL, 2004.
+*
+* Permission to use, copy, modify, sell, and distribute this software
+* is hereby granted without fee, provided that the above copyright notice
+* appears in all copies, and that both that copyright notice and this
+* permission notice appear in supporting documentation.
+*
+* None of the above authors, nor IBM Haifa Research Laboratories, make any
+* representation about the suitability of this software for any
+* purpose. It is provided "as is" without express or implied warranty.
+**/
+
+
+#ifndef SAMPLE_UPDATE_POLICY_HPP
+#define SAMPLE_UPDATE_POLICY_HPP
+
+
+/**
+* <class
+* description = "A sample list-update policy."
+* comment = "This class serves to show the interface a list update functor
+* needs to support.">
+**/
+class sample_update_policy
+{
+/**
+*******************************************************************************
+*******************************************************************************
+* <public_methods_group>
+**/
+public:
+ /**
+ ***************************************************************************
+ ***************************************************************************
+ ** <group description = "Constructors, destructor, and related.">
+ **/
+
+ /*
+ * <fn description = "Default constructor."
+ * comment = "Must be default constructible.">
+ **/
+ sample_update_policy
+ ();
+ /** </fn> **/
+
+ /*
+ * <fn description = "Copy constructor."
+ * comment = "Must be copy constructible.">
+ **/
+ sample_update_policy
+ (const sample_update_policy &r_other);
+ /** </fn> **/
+
+ /*
+ * <fn description = "Swaps content."
+ * comment = "Must be swappable (if there is such a word).">
+ **/
+ inline void
+ swap
+ (sample_update_policy &r_other);
+ /** </fn> **/
+
+ /*
+ ***************************************************************************
+ ***************************************************************************
+ * </group>
+ **/
+
+/**
+*******************************************************************************
+*******************************************************************************
+* </public_methods_group>
+**/
+
+
+/**
+*******************************************************************************
+*******************************************************************************
+* <protected_types_group>
+**/
+protected:
+
+ /**
+ ***************************************************************************
+ ***************************************************************************
+ ** <group description = "Metadata definitions.">
+ **/
+
+ /**
+ * <tdef description = "Metadata on which this functor operates."
+ * comment = "The class must declare the metadata type on which it
+ * operates; the list-update based containers will append to
+ * each node an object of this type.">
+ **/
+ typedef
+ some_metadata_type
+ metadata_type;
+ /** </tdef> **/
+
+
+ /*
+ ***************************************************************************
+ ***************************************************************************
+ * </group>
+ **/
+
+/**
+*******************************************************************************
+*******************************************************************************
+* </protected_types_group>
+**/
+
+
+/**
+*******************************************************************************
+*******************************************************************************
+* <protected_methods_group>
+**/
+protected:
+ /**
+ ***************************************************************************
+ ***************************************************************************
+ ** <group description = "Metadata operations.">
+ **/
+
+ /*
+ * <fn description = "Creates a metadata object."
+ * comment = "A list-update based container object will call this
+ * method to create a metadata type when a node is created.">
+ **/
+ metadata_type
+ operator()
+ () const;
+ /** </fn> **/
+
+ /*
+ * <fn description = "Decides whether a metadata object should be
+ * moved to the front of the list. A list-update based containers object
+ * will call this
+ * method to decide whether to move a node to the front of
+ * the list. The method shoule return true if the node should
+ * be moved to the front of the list."
+ * comment = "@@sample_update_policy_metadata_reference">
+ **/
+ bool
+ operator()
+ (metadata_reference r_data) const;
+ /** </fn> **/
+
+ /*
+ ***************************************************************************
+ ***************************************************************************
+ * </group>
+ **/
+
+/**
+*******************************************************************************
+*******************************************************************************
+* </protected_methods_group>
+**/
+};
+/**
+* </class>
+**/
+
+
+#endif // #ifndef SAMPLE_UPDATE_POLICY_HPP
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/size_policies_general.html b/libstdc++-v3/docs/html/ext/pb_assoc/size_policies_general.html
new file mode 100644
index 0000000..d79d68a
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/size_policies_general.html
@@ -0,0 +1,22 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+<html>
+<head>
+<title>Size Policies</title>
+<meta name="GENERATOR" content="Microsoft Visual Studio .NET 7.1">
+<meta name="vs_targetSchema" content="http://schemas.microsoft.com/intellisense/ie5">
+</head>
+<body>
+<h1>Size Policies</h1>
+
+<p>
+ A size policy, say <tt>size_pol</tt>, should support
+the types and
+methods below.
+<ol>
+ <li><a href = "size_policy_types.html">Types</a></li>
+ <li> <a href = "size_policy_methods.html">Methods</a></li>
+</ol>
+</p>
+
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/splay_tree_ds_tag.html b/libstdc++-v3/docs/html/ext/pb_assoc/splay_tree_ds_tag.html
new file mode 100644
index 0000000..71d8e3f7
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/splay_tree_ds_tag.html
@@ -0,0 +1,74 @@
+
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+
+
+<html>
+<head>
+<title>splay_tree_ds_tag Interface
+</title>
+
+</head>
+
+<body>
+<h1>
+<tt>splay_tree_ds_tag
+</tt>
+
+ Interface
+
+
+</h1>
+
+<p>Splay tree data-structure tag.
+</p>
+
+<ol>
+<li>
+<a href = "../../../../include/ext/pb_assoc/ds_trait.hpp"><tt>ds_trait.hpp</tt>
+</a>
+
+</li>
+
+<li>
+<a href = "#link1">Base classes.
+</a>
+
+</li>
+
+</ol>
+
+
+<h2>
+<a name = "link1">Base classes.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "80%" ALIGN = "left"><b>Class</b></TD><TD Width = "20%" ALIGN = "left"><b>Derivation Type</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a href = "basic_tree_ds_tag.html"><tt>basic_tree_ds_tag</tt></a></pre>
+
+
+</td>
+
+<td>
+<p>public</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+
+
+</body>
+
+</html>
+
+
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/timing_tests.html b/libstdc++-v3/docs/html/ext/pb_assoc/timing_tests.html
new file mode 100644
index 0000000..8fd034c
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/timing_tests.html
@@ -0,0 +1,60 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+<html>
+<head>
+<title>Timing Tests</title>
+<meta name="GENERATOR" content="Microsoft Visual Studio .NET 7.1">
+<meta name="vs_targetSchema" content="http://schemas.microsoft.com/intellisense/ie5">
+</head>
+<body bgcolor = "white">
+<h1>Timing Tests</h1>
+
+<p>
+ This section describes timing tests and their results. The tests were
+performed on two systems:
+</p>
+<ol>
+ <li> </li>
+ <li> Intel </li>
+</ol>
+
+<p>
+ The tests are organized as follows:
+</p>
+<ol>
+ <li><a href = "#hash_based">Hash-Based Container Tests</a>
+ shows tests pertaining to hash-based containers.
+ </li>
+ <li><a href = "#hash_based">Tree-Based Container Tests</a>
+ shows tests pertaining to tree-based containers.
+ </li>
+</ol>
+
+<h2><a name = "hash_based">Hash-Based Container Tests</a></h2>
+
+<h3>Random-Integer Find Test</h3>
+
+<p>
+ This test measurs the average time to find an entry
+in a &quot;set&quot; as a function of the &quot;set&quot;'s
+size.</p>
+_
+<p>
+ The test's purpose is to find the effect of
+different range-hashing functions. See
+<a href = "hash_based_containers.html#hash_policies">Hash-Based Containers::Resize Policies</a>
+</p>
+
+<p>
+Source code:
+<a href = "../testsuite/timing/hash_random_int_find_timing_test.cpp"><tt>hash_random_int_find_timing_test.cpp</tt></a>.
+</p>
+
+<p>
+Execution: <tt>hash_random_int_find_timing_test </tt>
+</p>
+
+
+<h2><a name = "tree_based">Tree-Based Container Tests</a></h2>
+
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/toc.html b/libstdc++-v3/docs/html/ext/pb_assoc/toc.html
new file mode 100644
index 0000000..c46f160
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/toc.html
@@ -0,0 +1,35 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+<HTML>
+<HEAD>
+<TITLE>Table of Contents</TITLE>
+<META NAME="Generator" content="Microsoft Visual Studio .NET 7.1">
+<base target = "content">
+</HEAD>
+<BODY>
+<H1>Contents</H1>
+
+
+<a href = "home.html">Main Page</a>
+
+<OL>
+ <li> <a href = "introduction.html">Introduction</a></li>
+ <li> <A HREF= "motivation.html">Motivation</A> </li>
+ <li> <a href = "design.html">Design</a>
+ <ol>
+ <li> <a href = "overview.html">Overview</a></li>
+ </ol>
+ </li>
+ <li> <a href = "interface.html">Interface</a>
+ <ol>
+ <li> <a href = "tutorial.html">Short Tutorial</a></li>
+ </ol>
+ <li> <a href = "examples.html">Examples</a> </li>
+ <li> <a href = "regression_tests.html">Regression Tests</a> </li>
+ <li> <a href = "timing_tests.html">Timing Tests</a> </li>
+ <li> <a href = "contact.html">Contact</a></li>
+ <li> <a href = "acks.html">Acknowledgements</a> </li>
+ <li> <a href = "disclaimer.html">Disclaimer and Copyright</a> </li>
+ <li> <a href="references.html">References</a> </li>
+</OL>
+</BODY>
+</HTML>
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/tree_assoc_cntnr.html b/libstdc++-v3/docs/html/ext/pb_assoc/tree_assoc_cntnr.html
new file mode 100644
index 0000000..f524f96
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/tree_assoc_cntnr.html
@@ -0,0 +1,493 @@
+
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+
+
+<html>
+<head>
+<title>tree_assoc_cntnr Interface
+</title>
+
+</head>
+
+<body>
+<h1>
+<tt>tree_assoc_cntnr
+</tt>
+
+ Interface
+
+
+</h1>
+
+<p>A tree-based associative container.
+</p>
+
+<ol>
+<li>
+<a href = "../../../../include/ext/pb_assoc/assoc_cntnr.hpp"><tt>assoc_cntnr.hpp</tt>
+</a>
+
+</li>
+
+<li>
+<a href = "#link1">Template parameters.
+</a>
+
+</li>
+
+<li>
+<a href = "#link2">Base classes.
+</a>
+
+</li>
+
+<li>
+Public Types and Constants:
+
+
+<ol>
+<li>
+<a href = "#link3">Policy definitions.
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+<li>
+Public Methods:
+
+
+<ol>
+<li>
+<a href = "#link4">Constructors, destructor, and related.
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+</ol>
+
+
+<h2>
+<a name = "link1">Template parameters.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "20%" ALIGN = "left"><b>Parameter</b></TD><TD Width = "50%" ALIGN = "left"><b>Description</b></TD><TD Width = "30%" ALIGN = "left"><b>Default Value</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "Key3735928856">Key</a></pre>
+
+
+</td>
+
+<td>
+<p>Key type.</p>
+
+
+</td>
+
+<td>
+-
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "Data3735928937">Data</a></pre>
+
+
+</td>
+
+<td>
+<p>Data type.</p>
+
+
+</td>
+
+<td>
+-
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "Cmp_Fn3735929122">Cmp_Fn</a></pre>
+
+
+</td>
+
+<td>
+<p>Comparison functor.</p>
+
+
+</td>
+
+<td>
+<pre>std::less&lt;<a href = "#Key3735928856">Key</a>&gt;</pre>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "DS_Tag3735929089">DS_Tag</a></pre>
+
+
+</td>
+
+<td>
+<p>Data-structure tag.</p>
+
+
+</td>
+
+<td>
+-
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "Node_Updator3735929779">Node_Updator</a></pre>
+
+
+</td>
+
+<td>
+<p>Node updator type.</p>
+
+
+<p><a href = "concepts.html#concepts_node_invariants">Node Invariants</a> explains this concept.</p>
+
+
+</td>
+
+<td>
+<a href = "null_node_updator.html"><tt>null_node_updator</tt></a>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "Allocator3735929488">Allocator</a></pre>
+
+
+</td>
+
+<td>
+<p>Allocator type.</p>
+
+
+</td>
+
+<td>
+<pre>std::allocator&lt;<b>char</b>&gt;</pre>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link2">Base classes.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "80%" ALIGN = "left"><b>Class</b></TD><TD Width = "20%" ALIGN = "left"><b>Derivation Type</b></TD></TR>
+
+
+<tr>
+<td>
+<pre>Depending on whether <a href = "#DS_Tag3735929089">DS_Tag</a> is a type supporting reverse iteration,<ol> <li> <a href = "basic_tree_assoc_cntnr.html"><tt>basic_tree_assoc_cntnr</tt></a> no reverse-iteration specialization </li> <li> <a href = "basic_tree_assoc_cntnr_rev_it.html"><tt>basic_tree_assoc_cntnr</tt></a> reverse-iteration specialization </li></ol></pre>
+
+
+</td>
+
+<td>
+<p>public</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link3">Policy definitions.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "30%" ALIGN = "left"><b>Type</b></TD><TD Width = "55%" ALIGN = "left"><b>Definition</b></TD><TD Width = "15%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "cmp_fn3735929186">cmp_fn</a></pre>
+
+
+</td>
+
+<td>
+<pre><a href = "#Cmp_Fn3735929122">Cmp_Fn</a></pre>
+
+
+</td>
+
+<td>
+<p>Comparison functor type.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "node_updator3735929843">node_updator</a></pre>
+
+
+</td>
+
+<td>
+<pre><a href = "#Node_Updator3735929779">Node_Updator</a></pre>
+
+
+</td>
+
+<td>
+<p>Node updator type.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link4">Constructors, destructor, and related.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "55%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre> tree_assoc_cntnr
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Default constructor.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre> tree_assoc_cntnr
+ (<b>const</b> <a href = "#cmp_fn3735929186">cmp_fn</a> &amp;r_cmp_fn)</pre>
+
+
+</td>
+
+<td>
+<p>Constructor taking some policy objects. <font color = "#666666"><tt>r_cmp_fn</tt></font> will be copied by the <a href = "#Cmp_Fn3735929122"><tt>Cmp_Fn</tt></a> object of the container object.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre> tree_assoc_cntnr
+ (<b>const</b> <a href = "#cmp_fn3735929186">cmp_fn</a> &amp;r_cmp_fn,
+ <b>const</b> <a href = "#Node_Updator3735929779">Node_Updator</a> &amp;r_node_updator)</pre>
+
+
+</td>
+
+<td>
+<p>Constructor taking some policy objects. <font color = "#666666"><tt>r_cmp_fn</tt></font> will be copied by the <a href = "#Cmp_Fn3735929122"><tt>Cmp_Fn</tt></a> object of the container object, and <font color = "#666666"><tt>r_node_updator</tt></font> will be copied by the <a href = "#Node_Updator3735929779"><tt>Node_Updator</tt></a> object of the container object.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>template</b>&lt;
+ <b>class</b> It&gt;
+ tree_assoc_cntnr
+ (It first_it,
+ It last_it)</pre>
+
+
+</td>
+
+<td>
+<p>Constructor taking iterators to a range of value_types. The value_types between <font color = "#666666"><tt>first_it</tt></font> and <font color = "#666666"><tt>last_it</tt></font> will be inserted into the container object.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>template</b>&lt;
+ <b>class</b> It&gt;
+ tree_assoc_cntnr
+ (It first_it,
+ It last_it,
+ <b>const</b> <a href = "#cmp_fn3735929186">cmp_fn</a> &amp;r_cmp_fn)</pre>
+
+
+</td>
+
+<td>
+<p>Constructor taking iterators to a range of value_types and some policy objects The value_types between <font color = "#666666"><tt>first_it</tt></font> and <font color = "#666666"><tt>last_it</tt></font> will be inserted into the container object. <font color = "#666666"><tt>r_cmp_fn</tt></font> will be copied by the <a href = "#Cmp_Fn3735929122"><tt>Cmp_Fn</tt></a> object of the container object.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>template</b>&lt;
+ <b>class</b> It&gt;
+ tree_assoc_cntnr
+ (It first_it,
+ It last_it,
+ <b>const</b> <a href = "#cmp_fn3735929186">cmp_fn</a> &amp;r_cmp_fn,
+ <b>const</b> <a href = "#Node_Updator3735929779">Node_Updator</a> &amp;r_node_updator)</pre>
+
+
+</td>
+
+<td>
+<p>Constructor taking iterators to a range of value_types and some policy objects The value_types between <font color = "#666666"><tt>first_it</tt></font> and <font color = "#666666"><tt>last_it</tt></font> will be inserted into the container object. <font color = "#666666"><tt>r_cmp_fn</tt></font> will be copied by the <a href = "#Cmp_Fn3735929122"><tt>Cmp_Fn</tt></a> object of the container object, and <font color = "#666666"><tt>r_node_updator</tt></font> will be copied by the <a href = "#Node_Updator3735929779"><tt>Node_Updator</tt></a> object of the container object.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre> tree_assoc_cntnr
+ (<b>const</b> <font color = "olive">tree_assoc_cntnr</font> &amp;r_other)</pre>
+
+
+</td>
+
+<td>
+<p>Copy constructor.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>virtual</b>
+ ~tree_assoc_cntnr
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Destructor.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><font color = "olive">tree_assoc_cntnr</font> &amp;
+ <b>operator</b>=
+ (<b>const</b> <font color = "olive">tree_assoc_cntnr</font> &amp;r_other)</pre>
+
+
+</td>
+
+<td>
+<p>Assignment operator.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>void</b>
+ swap
+ (<font color = "olive">tree_assoc_cntnr</font> &amp;r_other)</pre>
+
+
+</td>
+
+<td>
+<p>Swaps content.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+
+
+</body>
+
+</html>
+
+
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/tree_assoc_cntnr_const_node_iterator.html b/libstdc++-v3/docs/html/ext/pb_assoc/tree_assoc_cntnr_const_node_iterator.html
new file mode 100644
index 0000000..14aaced
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/tree_assoc_cntnr_const_node_iterator.html
@@ -0,0 +1,488 @@
+
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+
+
+<html>
+<head>
+<title>tree_assoc_cntnr::const_node_iterator Interface
+</title>
+
+</head>
+
+<body>
+<h1>
+<tt><font color = "olive">tree_assoc_cntnr</font>::const_node_iterator
+</tt>
+
+ Interface
+
+
+</h1>
+
+<p>Const node iterator.
+</p>
+
+<p>This is an
+</p>
+
+<ol>
+<li>
+Public Types and Constants:
+
+
+<ol>
+<li>
+<a href = "#link1">Iterator definitions.
+</a>
+
+</li>
+
+<li>
+<a href = "#link2">Value-type definitions.
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+<li>
+Public Methods:
+
+
+<ol>
+<li>
+<a href = "#link3">Constructors, destructor, and related.
+</a>
+
+</li>
+
+<li>
+<a href = "#link4">Access methods.
+</a>
+
+</li>
+
+<li>
+<a href = "#link5">Movement methods.
+</a>
+
+</li>
+
+<li>
+<a href = "#link6">Comparison methods.
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+</ol>
+
+
+<h2>
+<a name = "link1">Iterator definitions.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "30%" ALIGN = "left"><b>Type</b></TD><TD Width = "55%" ALIGN = "left"><b>Definition</b></TD><TD Width = "15%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "iterator_category3735929377">iterator_category</a></pre>
+
+
+</td>
+
+<td>
+<pre>trivial_iterator_tag</pre>
+
+
+</td>
+
+<td>
+<p>Category. comment = </p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "difference_type3735930139">difference_type</a></pre>
+
+
+</td>
+
+<td>
+<pre><b>void</b></pre>
+
+
+</td>
+
+<td>
+<p>Difference type.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link2">Value-type definitions.
+</a>
+
+</h2>
+
+<p>Note that a node iterator's value type is actually a tree iterator.</p>
+
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "30%" ALIGN = "left"><b>Type</b></TD><TD Width = "55%" ALIGN = "left"><b>Definition</b></TD><TD Width = "15%" ALIGN = "left"><b>Description</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a name = "value_type3735929645">value_type</a></pre>
+
+
+</td>
+
+<td>
+<pre><a href = "../../pb_assoc/doc/tree_assoc_cntnr.html#const_iterator3735930079">const_iterator</a></pre>
+
+
+</td>
+
+<td>
+<p>Iterator's value type.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "pointer3735929328">pointer</a></pre>
+
+
+</td>
+
+<td>
+<pre><a href = "../../pb_assoc/doc/tree_assoc_cntnr.html#const_iterator3735930079">const_iterator</a> *</pre>
+
+
+</td>
+
+<td>
+<p>Iterator's pointer type.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "const_pointer3735929974">const_pointer</a></pre>
+
+
+</td>
+
+<td>
+<pre><a href = "../../pb_assoc/doc/tree_assoc_cntnr.html#const_iterator3735930079">const_iterator</a> *</pre>
+
+
+</td>
+
+<td>
+<p>Iterator's const pointer type.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "reference3735929502">reference</a></pre>
+
+
+</td>
+
+<td>
+<pre><a href = "../../pb_assoc/doc/tree_assoc_cntnr.html#const_iterator3735930079">const_iterator</a> &amp;</pre>
+
+
+</td>
+
+<td>
+<p>Iterator's reference type.</p>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><a name = "const_reference3735930148">const_reference</a></pre>
+
+
+</td>
+
+<td>
+<pre><b>const</b> <a href = "../../pb_assoc/doc/tree_assoc_cntnr.html#iterator3735929433">iterator</a> &amp;</pre>
+
+
+</td>
+
+<td>
+<p>Iterator's const reference type.</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link3">Constructors, destructor, and related.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "40%" ALIGN = "left"><b>Description</b></TD><TD Width = "10%" ALIGN = "left"><b>Complexity Guarantee</b></TD><TD Width = "5%" ALIGN = "left"><b>Exception Guarantee</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>inline</b>
+ const_node_iterator
+ (<b>const</b> node_pointer p_nd = NULL)</pre>
+
+
+</td>
+
+<td>
+<p>Default constructor.</p>
+
+
+</td>
+
+<td>
+<p> <i>O(1)</i> worst.</p>
+
+
+</td>
+
+<td>
+<a href = "exception_guarantees_specifics.html#cannot_throw_guarantee">3</a>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link4">Access methods.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "40%" ALIGN = "left"><b>Description</b></TD><TD Width = "10%" ALIGN = "left"><b>Complexity Guarantee</b></TD><TD Width = "5%" ALIGN = "left"><b>Exception Guarantee</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>inline</b> <a href = "../../pb_assoc/doc/tree_assoc_cntnr.html#const_iterator3735930079">const_iterator</a>
+ <b>operator</b>*
+ () <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Access.</p>
+
+
+</td>
+
+<td>
+<p> <i>O(1)</i> worst.</p>
+
+
+</td>
+
+<td>
+<a href = "exception_guarantees_specifics.html#cannot_throw_guarantee">3</a>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link5">Movement methods.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "40%" ALIGN = "left"><b>Description</b></TD><TD Width = "10%" ALIGN = "left"><b>Complexity Guarantee</b></TD><TD Width = "5%" ALIGN = "left"><b>Exception Guarantee</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>inline</b> const_node_iterator
+ l_child
+ () <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Returns the <tt><b>const</b></tt> node <a href = "../../pb_assoc/doc/tree_assoc_cntnr.html#iterator3735929433">iterator</a> associated with the left node.</p>
+
+
+</td>
+
+<td>
+<p> <i>O(1)</i> worst.</p>
+
+
+</td>
+
+<td>
+<a href = "exception_guarantees_specifics.html#cannot_throw_guarantee">3</a>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> const_node_iterator
+ r_child
+ () <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Returns the <tt><b>const</b></tt> node <a href = "../../pb_assoc/doc/tree_assoc_cntnr.html#iterator3735929433">iterator</a> associated with the right node.</p>
+
+
+</td>
+
+<td>
+<p> <i>O(1)</i> worst.</p>
+
+
+</td>
+
+<td>
+<a href = "exception_guarantees_specifics.html#cannot_throw_guarantee">3</a>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link6">Comparison methods.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "40%" ALIGN = "left"><b>Description</b></TD><TD Width = "10%" ALIGN = "left"><b>Complexity Guarantee</b></TD><TD Width = "5%" ALIGN = "left"><b>Exception Guarantee</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>inline</b> <b>bool</b>
+ <b>operator</b>==
+ (<b>const</b> const_node_iterator &amp;r_other) <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Compares content to a different <a href = "../../pb_assoc/doc/tree_assoc_cntnr.html#iterator3735929433">iterator</a> object.</p>
+
+
+</td>
+
+<td>
+<p> <i>O(1)</i> worst.</p>
+
+
+</td>
+
+<td>
+<a href = "exception_guarantees_specifics.html#cannot_throw_guarantee">3</a>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> <b>bool</b>
+ <b>operator</b>!=
+ (<b>const</b> const_node_iterator &amp;r_other) <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Compares content (negatively) to a different <a href = "../../pb_assoc/doc/tree_assoc_cntnr.html#iterator3735929433">iterator</a> object.</p>
+
+
+</td>
+
+<td>
+<p> <i>O(1)</i> worst.</p>
+
+
+</td>
+
+<td>
+<a href = "exception_guarantees_specifics.html#cannot_throw_guarantee">3</a>
+
+
+</td>
+
+</tr>
+
+</table>
+
+
+
+</body>
+
+</html>
+
+
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/tree_assoc_cntnr_node_iterator.html b/libstdc++-v3/docs/html/ext/pb_assoc/tree_assoc_cntnr_node_iterator.html
new file mode 100644
index 0000000..651f19b
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/tree_assoc_cntnr_node_iterator.html
@@ -0,0 +1,250 @@
+
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+
+
+<html>
+<head>
+<title>tree_assoc_cntnr::node_iterator Interface
+</title>
+
+</head>
+
+<body>
+<h1>
+<tt><font color = "olive">tree_assoc_cntnr</font>::node_iterator
+</tt>
+
+ Interface
+
+
+</h1>
+
+<p>Node iterator.
+</p>
+
+<p>This is an
+</p>
+
+<ol>
+<li>
+<a href = "#link1">Base classes.
+</a>
+
+</li>
+
+<li>
+Public Methods:
+
+
+<ol>
+<li>
+<a href = "#link2">Constructors, destructor, and related.
+</a>
+
+</li>
+
+<li>
+<a href = "#link3">Access methods.
+</a>
+
+</li>
+
+<li>
+<a href = "#link4">Movement methods.
+</a>
+
+</li>
+
+</ol>
+
+</li>
+
+</ol>
+
+
+<h2>
+<a name = "link1">Base classes.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "80%" ALIGN = "left"><b>Class</b></TD><TD Width = "20%" ALIGN = "left"><b>Derivation Type</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><a href = "../../pb_assoc/doc/tree_assoc_cntnr.html#const_node_iterator3735929535">const_node_iterator</a></pre>
+
+
+</td>
+
+<td>
+<p>public</p>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link2">Constructors, destructor, and related.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "40%" ALIGN = "left"><b>Description</b></TD><TD Width = "10%" ALIGN = "left"><b>Complexity Guarantee</b></TD><TD Width = "5%" ALIGN = "left"><b>Exception Guarantee</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>inline</b>
+ node_iterator
+ (<b>const</b> node_pointer p_nd = NULL)</pre>
+
+
+</td>
+
+<td>
+<p>Default constructor.</p>
+
+
+</td>
+
+<td>
+<p> <i>O(1)</i> worst.</p>
+
+
+</td>
+
+<td>
+<a href = "exception_guarantees_specifics.html#cannot_throw_guarantee">3</a>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link3">Access methods.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "40%" ALIGN = "left"><b>Description</b></TD><TD Width = "10%" ALIGN = "left"><b>Complexity Guarantee</b></TD><TD Width = "5%" ALIGN = "left"><b>Exception Guarantee</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>inline</b> <a href = "../../pb_assoc/doc/tree_assoc_cntnr.html#iterator3735929433">iterator</a>
+ <b>operator</b>*
+ () <b>const</b></pre>
+
+
+</td>
+
+<td>
+<p>Access.</p>
+
+
+</td>
+
+<td>
+<p> <i>O(1)</i> worst.</p>
+
+
+</td>
+
+<td>
+<a href = "exception_guarantees_specifics.html#cannot_throw_guarantee">3</a>
+
+
+</td>
+
+</tr>
+
+</table>
+
+<h2>
+<a name = "link4">Movement methods.
+</a>
+
+</h2>
+
+<table WIDTH = "100%" BORDER = "1">
+<TR><TD Width = "45%" ALIGN = "left"><b>Method</b></TD><TD Width = "40%" ALIGN = "left"><b>Description</b></TD><TD Width = "10%" ALIGN = "left"><b>Complexity Guarantee</b></TD><TD Width = "5%" ALIGN = "left"><b>Exception Guarantee</b></TD></TR>
+
+
+<tr>
+<td>
+<pre><b>inline</b> node_iterator
+ l_child
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Returns the node <a href = "../../pb_assoc/doc/tree_assoc_cntnr.html#iterator3735929433">iterator</a> associated with the left node.</p>
+
+
+</td>
+
+<td>
+<p> <i>O(1)</i> worst.</p>
+
+
+</td>
+
+<td>
+<a href = "exception_guarantees_specifics.html#cannot_throw_guarantee">3</a>
+
+
+</td>
+
+</tr>
+
+<tr>
+<td>
+<pre><b>inline</b> node_iterator
+ r_child
+ ()</pre>
+
+
+</td>
+
+<td>
+<p>Returns the node <a href = "../../pb_assoc/doc/tree_assoc_cntnr.html#iterator3735929433">iterator</a> associated with the right node.</p>
+
+
+</td>
+
+<td>
+<p> <i>O(1)</i> worst.</p>
+
+
+</td>
+
+<td>
+<a href = "exception_guarantees_specifics.html#cannot_throw_guarantee">3</a>
+
+
+</td>
+
+</tr>
+
+</table>
+
+
+
+</body>
+
+</html>
+
+
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/tree_based_containers.html b/libstdc++-v3/docs/html/ext/pb_assoc/tree_based_containers.html
new file mode 100644
index 0000000..08ee428
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/tree_based_containers.html
@@ -0,0 +1,246 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+<html>
+ <head>
+ <title>Tree-Based Containers</title>
+ <meta name="GENERATOR" content="Microsoft Visual Studio .NET 7.1">
+ <meta name="vs_targetSchema" content="http://schemas.microsoft.com/intellisense/ie5">
+ </head>
+<body bgcolor = "white">
+<h1>Tree-Based Containers</h1>
+
+<p>
+ This section describes tree-based containers. It is organized as follows.
+</p>
+
+<ol>
+ <li> <a href = "#overview">Overview</a> describes an overview.</li>
+ <li> <a href = "#invariants">Node Invariants</a> describes node invariants.</li>
+ <li> <a href = "#add_methods">Additional Types and Methods</a> describes additional methods
+that tree-based containers support.</li>
+</ol>
+
+<h2><a name = "overview">Overview</a></h2>
+
+<p>
+ Figure
+<a href = "#tree_cd">Tree-based containers</a>
+ shows the container-hierarchy; the tree-based container is circled.
+</p>
+
+<h6 align = "center">
+<a name = "tree_cd">
+<img src = "tree_cd.jpg" width = "70%" alt = "no image">
+</h6>
+<h6 align = "center">
+</a>
+Tree-based containers.
+</h6>
+
+
+<p>
+ The tree-based container has the following declaration:
+</p>
+<pre>
+<b>template</b>&lt;
+ <b>typename</b> Key,
+ <b>typename</b> Data,
+ <b>class</b> Cmp_Fn = std::less&lt;Key&gt;,
+ <b>class</b> DS_Tag = <a href = "rb_tree_ds_tag.html">rb_tree_ds_tag</a>,
+ <b>class</b> Node_Updator = <a href = "null_node_updator.html">null_node_updator</a>,
+ <b>class</b> Allocator =
+ std::allocator&lt;<b>char</b>&gt; &gt;
+<b>class</b> <a href = "tree_assoc_cntnr.html">tree_assoc_cntnr</a>;
+</pre>
+
+
+<p>
+ The parameters have the following meaning:
+</p>
+<ol>
+ <li> <tt>Key</tt> is the key type.
+ </li>
+ <li> <tt>Data</tt> is the data-policy, and is explained in
+<a href = "ms_gen.html#ds_policy">Mapping-Semantics Genericity::Data Types as a Policy</a>.
+ </li>
+ <li> <tt>Cmp_Fn</tt> is a key comparison functor</li>
+ <li> <tt>DS_Tag</tt> specifies which underlying data-structure to use, and is described shortly.
+ <li> <tt>Node_Updator</tt> is a policy for updating node invariants.
+This is described in <a href = "#invariants">Node Invariants</a>.
+ </li>
+ <li> <tt>Allocator</tt> is (surprisingly) an allocator type.
+ </li>
+</ol>
+
+<p>
+ The <tt>DS_Tag</tt> specifies which underlying data-structure to use.
+Instantiating it by
+<a href = "rb_tree_ds_tag.html">rb_tree_ds_tag</a>,
+<a href = "splay_tree_ds_tag.html">splay_tree_ds_tag</a>,
+or
+<a href = "ov_tree_ds_tag.html">ov_tree_ds_tag</a>,
+specifies an undelying
+red-black tree,
+splay tree,
+or
+ordered-vector tree.
+ any other tag is illegal. Note that containers based on the former two contain more types and methods than the latter (<i>e.g.</i>, <tt>reverse_iterator</tt> and <tt>rbegin</tt>), and different exception and invalidation guarantees.
+</p>
+
+
+
+
+<h2><a name = "invariants">Node Invariants</a></h2>
+
+<p>
+ Figure
+<a href = "#node_invariants">Some node invariants</a>
+shows some node invariants. A shows
+a tree whose each node contains, asides from an <tt>double</tt> key, the number
+of nodes at the subtree rooted at the node; B shows a tree whose each node
+contains, asides from a line-interval key, the maximal endpoint of the interval
+of any node in the subtree rooted at the node.
+ The first tree allows querying efficiently what is the order statistic
+of any element; the second tree allows querying efficiently if any, or which,
+intervals overlap a given interval.
+</p>
+
+<h6 align = "center">
+<a name = "node_invariants">
+<img src = "node_invariants.jpg" width = "50%" alt = "no image">
+</a>
+</h6>
+<h6 align = "center">
+Some node invariants.
+</h6>
+
+
+<p>
+ Maintaining such trees is difficult, for two reasons:
+</p>
+<ol>
+ <li> Various operations can invalidate node invariants.
+<i>E.g.</i>, Figure
+<a href = "#node_invariant_invalidations">Invalidation of node invariants</a>
+shows how a right rotation, performed on A, results in B, with nodes <i>x</i>
+and <i>y</i> having corrupted invariants (the greyed nodes in C);
+Figure
+<a href = "#node_invariant_invalidations">Invalidation of node invariants</a>
+shows how an insert, performed on D, results in E, with nodes <i>x</i>
+and <i>y</i> having corrupted invariants (the greyed nodes in F).
+ It is not feasible to know outside the tree the effect of an operation on the
+nodes of the tree.
+ </li>
+ <li>
+ Even if node invariants are maintained, it is not possible to know
+in advance which search paths are required (<i>e.g.</i>, searching for all
+line intervals overlapping some interval might require several search paths).
+ </li>
+</ol>
+
+
+<h6 align = "center">
+<a name = "node_invariant_invalidations">
+<img src = "node_invariant_invalidations.jpg" width = "80%" alt = "no image">
+</a>
+</h6>
+<h6 align = "center">
+Invalidation of node invariants.
+</h6>
+
+<p>
+ These problems are solved by a combination of two means:
+</p>
+
+<ol>
+ <li>
+ The tree-based containers are parameterized by a <tt>Node_Updator</tt>
+parameter. When a tree operation might invalidate some node invariant,
+a <tt>Node_Updator</tt> object is invoked to restore the invariant. This object is
+always invoked with three nodes: some node, say <i>x</i> in
+Figure
+<a href = "#restoring_node_invariants">Invalidation of node invariants</a>-A
+has an invalid invariant, but its children, <i>y</i> and <i>z</i> hav valid invariants.
+After the invocation, all three nodes have valid invariants, as
+in
+Figure
+<a href = "#restoring_node_invariants">Invalidation of node invariants</a>-B.
+It is well known that any <tt>insert</tt>, <tt>erase</tt>,
+<tt>split</tt> or <tt>join</tt>, can restore
+all node invariants by a small number of node invariant updates
+[<a href = "references.html#clrs2001">clrs2001</a>].
+For example, Figure
+<a href = "#update_seq_diagram">
+Insert update sequence diagram
+</a>
+shows an <tt>insert</tt> operation (point A); the tree performs some operations, and
+calls the update functor three times (points B, C, and D).
+ </li>
+ <li>
+ The tree based containers all define internally <tt>node_iterator</tt>
+ and <tt>const_node_iterator</tt>, iterators which can be used to traverse
+ from a node to any of its children or parent.
+ </li>
+</ol>
+
+<h6 align = "center">
+<a name = "restoring_node_invariants">
+<img src = "restoring_node_invariants.jpg" width = "80%" alt = "no image">
+</a>
+</h6>
+<h6 align = "center">
+Invalidation of node invariants.
+</h6>
+
+<h6 align = "center">
+<a name = "update_seq_diagram">
+<img src = "update_seq_diagram.jpg" width = "50%" alt = "no image">
+</a>
+</h6>
+<h6 align = "center">
+Insert update sequence diagram.
+</h6>
+
+
+<p>
+ In
+<a href = "concepts.html#concepts_null_policies">Null Policy Classes</a>
+a distinction was made between <i>redundant policies</i>
+and <i>null policies</i>.
+</p>
+
+<p>
+ Seemingly, in this case a redundant policy - a policy which doesn't
+affect nodes' contents would suffice in this case. This, however, would
+lead to performance loss.
+Figure
+<a href = "#rationale_null_node_updator">
+Rationale for null node-invariant functors
+</a>
+shows a typical case where invariants are restored (in this case, to the
+shaded node). In most cases, tree operations such as rotations affect only
+the lower levels of the tree. A null policy allows to know that there
+is no need to traverse the tree to the root.
+</p>
+
+<h6 align = "center">
+<a name = "rationale_null_node_updator">
+<img src = "rationale_null_node_updator.jpg" width = "50%" alt = "no image">
+</a>
+</h6>
+<h6 align = "center">
+Rationale for null node-invariant functors.
+</h6>
+
+
+
+<h2><a name = "add_methods">Addtional Methods</a></h2>
+
+
+
+
+
+
+
+</body>
+
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/tree_cd.jpg b/libstdc++-v3/docs/html/ext/pb_assoc/tree_cd.jpg
new file mode 100644
index 0000000..95afe31
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/tree_cd.jpg
Binary files differ
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/trigger_policies_general.html b/libstdc++-v3/docs/html/ext/pb_assoc/trigger_policies_general.html
new file mode 100644
index 0000000..5535bb9
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/trigger_policies_general.html
@@ -0,0 +1,23 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+<html>
+<head>
+ <title>Trigger Policies</title>
+ <meta name="GENERATOR" content="Microsoft Visual Studio .NET 7.1">
+ <meta name="vs_targetSchema" content="http://schemas.microsoft.com/intellisense/ie5">
+</head>
+
+<body>
+
+<h1>Trigger Policies</h1>
+
+<p>
+ A trigger policy, say <tt>trig_pol</tt>, should support
+ the types and methods below.
+</p>
+<ol>
+ <li> <a href="trigger_policy_types.html">Types</a></li>
+ <li> <a href="trigger_policy_methods.html">Methods</a></li>
+</ol>
+
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/tutorial.html b/libstdc++-v3/docs/html/ext/pb_assoc/tutorial.html
new file mode 100644
index 0000000..b5dd0f5
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/tutorial.html
@@ -0,0 +1,66 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+<HTML>
+<HEAD>
+<TITLE>Short Tutorial</TITLE>
+<META NAME="Generator" content="Microsoft Visual Studio .NET 7.1">
+<base target = "content">
+</HEAD>
+<BODY>
+<H1>Short Tutorial</H1>
+
+<p>
+ Following is a short tutorial introducing the main points of <tt>pb_assoc</tt>. It
+is organized as follows.</p>
+<ol>
+ <li><a href = "#general_use">Basic Use of Maps</a></li>
+</ol>
+
+
+
+
+
+
+
+<h2><a name = "general_use">Basic Use of Maps</a></h2>
+
+<p>
+ For the greater part, using <tt>pb_assoc</tt>'s maps is similar
+to using those of the STL. For example, the following shows a collision-chaining container mapping integers to characters.
+
+<pre>
+<a href = "cc_hash_assoc_cntnr.html">cc_hash_assoc_cntnr</a>&lt;<b>int</b>, <b>char</b>&gt; c;
+
+c[2] = 'b';
+
+assert(c.find(1) == c.end());
+</pre>
+
+<p>
+ <a href="interface.html#containers">Inteface::Containers</a> describes the containers supported. <a href = "../example/basic_map_example.cpp"><tt>basic_map_example.cpp</tt></a>
+shows an example.
+</p>
+
+
+<h2><a name = "ms">Other Mapping Semantics</a></h2>
+
+<p>
+ <tt>pb_assoc</tt> does not contain separate containers for different mapping semantics,
+as the STL does (<i>e.g.</i>, <tt>std::map</tt> and <tt>std::multimap</tt>). Rather, containers are parameterized by a <tt>Data</tt> parameter, and this parameter is a policy for the mapping semantics.
+</p>
+
+<p>
+ Instantiating the <tt>Data</tt> parameter by
+<a href = "null_data_type.html"><tt>null_data_type</tt></a>
+makes a &quot;set&quot;. For example, the following shows a collision-chaining container storing integers.
+
+<pre>
+<a href = "cc_hash_assoc_cntnr.html">cc_hash_assoc_cntnr</a>&lt;<b>int</b>, <a href = "null_data_type.html">null_data_type</a>&gt; c;
+
+c.insert(2);
+
+assert(c.find(1) == c.end());
+</pre>
+</p>
+
+</BODY>
+</HTML>
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/update_seq_diagram.jpg b/libstdc++-v3/docs/html/ext/pb_assoc/update_seq_diagram.jpg
new file mode 100644
index 0000000..d3221cb
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_assoc/update_seq_diagram.jpg
Binary files differ
generated by cgit v1.1 at 2025-01-24 18:57:02 +0000